# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43344 | Hassoony | Prosjecni (COCI16_prosjecni) | C++14 | 2 ms | 644 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;
typedef long long ll;
const int MX=109;
int n,a[MX][MX];
int main(){
scanf("%d",&n);
if(n==1){
cout<<1<<endl;
return 0;
}
if(n%2==0){
puts("-1");
return 0;
}
int cnt=-1;
for(int i=0;i<n-1;i++){
for(int j=0;j<n-1;j++){
a[i][j]=cnt+=2;
}
}
for(int i=0;i<n-1;i++){
int sum=0;
for(int j=0;j<n-1;j++){
sum+=a[i][j];
}
a[i][n-1]=sum;
}
for(int i=0;i<n;i++){
int sum=0;
for(int j=0;j<n-1;j++){
sum+=a[j][i];
}
a[n-1][i]=sum;
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cout<<a[i][j]<<" ";
}
cout<<endl;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |