# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
242554 | topovik | Prosjecni (COCI16_prosjecni) | C++14 | 6 ms | 512 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 f first
#define s second
#define pb push_back
#define INF 1000000000
#define N (long)1e3
using namespace std;
typedef long long ll;
typedef long double ld;
int main()
{
int n;
cin>>n;
if (n&1)
{
for (int i=1; i<=n*n; i++)
{
cout<<i<<" ";
if (!(i%n)) cout<<endl;
}
return 0;
}
int a[n][n];
int sum=0;
for (int i=1; i<n; i++) a[0][i-1]=i,sum+=i;
a[0][n-1]=(n-1)*n-sum;
int x=a[0][n-1];
for (int i=1; i<n-1; i++)
for (int j=0; j<n; j++) a[i][j]=a[i-1][j]+x;
sum=0;
for (int i=1; i<n; i++) sum+=a[i-1][0];
sum=a[n-2][0]*n-sum;
for (int j=0; j<n-1; j++) a[n-1][j]=sum+j;
a[n-1][n-1]=sum+x-1;
for (int i=0; i<n; i++)
{
for (int j=0; j<n; j++) cout<<a[i][j]<<" ";
cout<<endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |