Educational Codeforces Round 16

 1 #include <cstdio>
 2 int dx[] = {0,0,1,1,1,-1,-1,-1};
 3 int dy[] = {1,-1,0,1,-1,0,1,-1,0};
 4 #define judge(x,y) x >= 1 && x <= 8 && y >= 1 && y <= 8
 5 int main()
 6 {
 7     char t;
 8     int x, y, cnt = 0;
 9     scanf("%c%d", &t, &y);
10     x = t - ‘a‘ + 1;
11     for(int i = 0; i < 8; i++)
12     {
13         int fx = x + dx[i], fy = y + dy[i];
14         if(judge(fx,fy))    cnt++;
15     }
16     printf("%d\n", cnt);
17     return 0;
18 }

#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long LL;
const int maxn = 3 * 1e5 + 5;
int x[maxn];
int main()
{
    int n;
    scanf("%d", &n);
    for(int i = 0; i < n; i++)
        scanf("%d", &x[i]);
    sort(x, x + n);
    printf("%d\n", x[ (n-1)/2 ]);
    return 0;
}

#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long LL;
const int maxn = 3 * 1e5 + 5;
int x[maxn];
int main()
{
    int n, odd = 1, even = 2;
    scanf("%d", &n);
    int mid = (n + 1) / 2;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            if( abs(i - mid) + abs(j - mid) <= mid - 1)
            {
                printf("%d%c", odd, j == n ? ‘\n‘ : ‘ ‘);
                odd +=2;
            }
            else
            {
                printf("%d%c", even, j == n ? ‘\n‘ : ‘ ‘);
                even +=2;
            }
        }
    }
    return 0;
}