# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
209121 | MertD014 | Prosjecni (COCI16_prosjecni) | C++17 | 6 ms | 380 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;
int dp(int w){
if(w==1) return 1;
return w+dp(w-1);
}
int n;
int main(){
//huh
cin>>n;
if(n==2) cout<<"-1";
else if(n%2){
for(int i=0;i<n;i++){
for(int j=0;j<n;j++)
cout<<i*n+j+1<<" ";
cout<<endl;
}
}
else{
int g=dp(n-1);
int sum=0;
int d[n],d2[n];
for(int i=0;i<n-1;i++){d[i]=i+1;}
d[n-1]=g;
for(int i=0;i<n-1;i++){d2[i]=1+g*i;sum+=d2[i];}
int bottomleft=d2[n-2]*n-sum;
int diff=g-n+1;
for(int i=0;i<n-1;i++){
for(int j=0;j<n;j++){
cout<<d[j]<<" ";
d[j]+=g;
}
cout<<endl;
}
for(int i=0;i<n-1;i++){
cout<<bottomleft+i<<" ";
}
cout<<bottomleft+n-2+diff;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |