# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
623678 | 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 rng(i,c,n) for(int i=c;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;
if(n==2){
printf("-1\n");
return 0;
}
int a[_n][_n],dro[_n],dco[_n];
if(n%2==0){
rng(i,1,n){
dro[i]=(i%2?1:-1)*(i+1)/2;
}
dro[n-1]+=1;
dro[1]-=dro[n-1];
int ad=dro[n-1]-dro[1]+1;
rng(j,1,n){
dco[j]=dco[j-1]+ad;
}
while(1){
int sun=0;
rep(j,n){
sun+=dco[j];
}
bool pok=0;
rep(j,n){
pok=pok or (dco[j]==sun/n);
}
if(pok) break;
dco[n-1]+=n;
}
rep(i,n){
rep(j,n){
a[i][j]=dco[j]+dro[i]+2*n+1;
}
}
}else{
rep(i,n){
rep(j,n){
a[i][j]=i*n+j+1;
}
}
}
rep(i,n){
rep(j,n){
printf("%d ",a[i][j]);
}
puts("");
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |