# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
623552 | inksamurai | Prosjecni (COCI16_prosjecni) | C++17 | 1 ms | 340 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;
#define rep(i,n) for(int i=0;i<n;i++)
#define _3SgiE60 ios::sync_with_stdio(0),cin.tie(0)
// e
const int _n=111;
signed main(){
_3SgiE60;
int n;
cin>>n;
int a[_n][_n];
if(n%2==0){
if(n==2){
printf("-1\n");
return 0;
}
rep(i,n){
rep(j,n) if(j)a[i][j]=(j%2?1:-1)*(j+1)/2;
a[i][n-1]*=-1;
a[i][1]+=n/2;
rep(j,n) a[i][j]+=n+i*n*2;
}
}else{
rep(i,n){
rep(j,n) a[i][j]=i*n+j+1;
}
}
rep(i,n){
int sun=0;
rep(j,n) sun+=a[i][j];
rep(j,n) printf("%d ", a[i][j]);
puts("");
// if(sun%n){
// // printf("sad %d %d\n",sun,i);
// return 0;
// }
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |