# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
133727 | forelax | Prosjecni (COCI16_prosjecni) | C++14 | 3 ms | 376 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 main(){
int n;
cin>>n;
if(n==2){
cout<<-1;
return 0;
}
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 sm=(n-2)*(n-1)/2;
int sk=sm+n-1;
for(int i = 0 ; i < n ; i ++){
for(int j = 0 ; j < n ; j ++){
cout<<i*sk+j+1+(j==n-1?sm-1:0)+(i==n-1?sm*sk-sk:0)<<" ";
}
cout<<endl;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |