# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
146717 | fabjanm | Prosjecni (COCI16_prosjecni) | C++98 | 2 ms | 504 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<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int mat[105][105];
int kolko[1000000];
int main(){
int n;
cin>>n;
if(n==1){
cout<<-1;
return 0;
}
if(n % 2 == 1){
int br=2*n;
int poc=n*10;
for(int i=0;i<n;i++){
mat[i][n/2+1]=poc;
poc+=br*2;
}
for(int i=0;i<n;i++){
int poc=mat[i][n/2+1];
for(int j=0;j<n;j++){
mat[i][j]=poc-2*(n/2-j);
kolko[mat[i][j]]++;
}
}
/*for(int i=0;i<10000;i++){
if(kolko[i]>1){
cout<<i<<endl;
system("pause");
}
}*/
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cout<<mat[i][j]<<" ";
}
cout<<endl;
}
}
else{
cout<<-1;
return 0;
int br=2*n;
int poc=n*10;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
}
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |