oj.uz

Submission #84048

# Submission time Handle Problem Language Result Execution time Memory
84048 2018-11-12T13:47:05 Z thiago4532 Prosjecni (COCI16_prosjecni) C++17
120 / 120
 4 ms 664 KB 
#include <bits/stdc++.h>

using namespace std;
const int maxn = 110;
int v[maxn][maxn];

int main(){
    ios::sync_with_stdio(false), cin.tie(0);
    int n;
    cin >> n;
    if(n == 2){
        cout << "-1\n";
        return 0;
    }

    for(int i=1;i<n;i++)
        v[i][1] = i;

    v[n][1] = (n*(n-1))/2;

    int eps = v[n][1];
    for(int i=1;i<=n;i++){
        for(int j=2;j<n;j++)
            v[i][j] = v[i][j-1] + eps;
    }
    for(int i=1;i<=n;i++){
        v[i][n] = v[i][n-1]*(n-1);
        for(int j=1;j<n-1;j++)
            v[i][n] -= v[i][j];
    }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            cout << v[i][j] << " \n"[j==n];
    return 0;
}

Subtask #1
120.0 / 120.0

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