# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
209131 | ArKCa | Prosjecni (COCI16_prosjecni) | C++17 | 6 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>
#define f1 first
#define s2 second
#define pb push_back
#define pob pop_back
#define int ll
#define ll long long
#define PII pair<int,int>
#define N 1000006
#define mod 1000000007
using namespace std;
int n;
int dizi[500],dizim[500],sum;
int32_t main(){
// freopen("a.gir","r",stdin);
// freopen("a.cik","w",stdout);
//
//
scanf("%lld" ,&n);
if(n==2){
printf("-1\n" );
return 0;
}
if(n%2==1){
for(int i=1;i<=n*n;i++){
printf("%lld ",i);
if(i%n==0)printf("\n");
}
return 0;
}
int sa=1;
for(int i=0;i<(n-1);i++){
sum=0;
for(int j=0;j<(n-1);j++){
printf("%lld ", sa);
sum+=sa;
dizi[j]+=sa;
dizim[j]=sa;
sa++;
}
printf("%lld\n",((sa-1)*n)-sum );
sa=((sa-1)*n)-sum;
sa++;
}
sum=0;
for(int i=0;i<(n-1);i++){
printf("%lld ",dizim[i]*n-dizi[i] );
sum+=dizim[i]*n-dizi[i];
sa=dizim[i]*n-dizi[i];
}
printf("%lld\n",sa*n-sum );
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |