oj.uz

Submission #164621

# Submission time Handle Problem Language Result Execution time Memory
164621 2019-11-22T09:00:06 Z _qVp_ Prosjecni (COCI16_prosjecni) C++14
120 / 120
 3 ms 504 KB 
#include <bits/stdc++.h>

using namespace std;

const int md = 105;

int n;
int a[md][md];

int main() {
    ios_base::sync_with_stdio(0);
    cin >> n;
    if (n == 2) {
        cout << "-1";
        return 0;
    }
    if (n & 1) {
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= n; j++)
                cout << (i - 1) * n + j << " ";
            cout << '\n';
        }
    } else {
        //0 1 2 3 4 -10
        int sum = (n - 1) * (n - 2) / 2;
        a[1][n] = 1;
        for(int i = 1; i < n; i++)
            a[1][i] = sum + i;
        int dist = a[1][n - 1];
        for(int i = 2; i < n; i++) {
            for(int j = 1; j <= n; j++)
                a[i][j] = a[i - 1][j] + dist;
        }
        for(int i = 1; i <= n; i++)
            a[n][i] = a[n - 1][i] * n - (a[1][i] * (n - 1) + dist * (n - 1) * (n - 2) / 2);
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= n; j++)
                cout << a[i][j] << " ";
            cout << '\n';
        }
    }
    return 0;
}

Subtask #1
120.0 / 120.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct