# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
301852 | colazcy | Prosjecni (COCI16_prosjecni) | C++17 | 2 ms | 512 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 <cstdio>
using namespace std;
const int maxn = 128;
int val[maxn][maxn],n;
int main(){
scanf("%d",&n);
if(n % 2 == 1){
int tot = 0;
for(int i = 1;i <= n;i++){
for(int j = 1;j <= n;j++)printf("%d ",++tot);
printf("\n");
}
return 0;
}
if(n == 2)return puts("-1"),0;
for(int i = 1;i < n;i++)val[1][i] = i;
int sum = 0;
for(int i = 1;i < n;i++)sum += val[1][i];
val[1][n] = val[1][n - 1] * n - sum;
for(int i = 2;i < n;i++)
for(int j = 1;j <= n;j++)
val[i][j] = val[i - 1][j] + val[1][n];
for(int i = 1;i <= n;i++){
int sum = 0;
for(int j = 1;j < n;j++)sum += val[j][i];
val[n][i] = val[n - 1][i] * n - sum;
}
for(int i = 1;i <= n;i++){
for(int j = 1;j <= n;j++)printf("%d ",val[i][j]);
printf("\n");
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |