# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
84048 | thiago4532 | Prosjecni (COCI16_prosjecni) | C++17 | 4 ms | 664 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |