#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1000000007;
const ll inf=1e18*4;
const ld pai=acos(-1);
int n;
ll a[109][109];
int main(){
cin>>n;
if(n==2)cout<<-1<<endl,exit(0);
if(n%2){
int num=1;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cout<<num<<" ";
num++;
}
cout<<endl;
}
exit(0);
}
ll num=1;
for(int i=0;i<n-1;i++){
int sum=0;
for(int j=0;j<n;j++){
cout<<num<<" ";
a[i][j]=num;
if(j==n-2){
num+=num*(n-2)-sum;
C;
}
sum+=num;
num+=2;
}
cout<<endl;
}
ll sum=0;
for(int i=0;i<n-2;i++)sum+=a[i][0];
num=a[n-2][0]*(n-2)-sum+a[n-2][0];
sum=0;
for(int i=0;i<n;i++){
cout<<num<<" ";
if(i==n-2){
num+=num*(n-2)-sum;
C;
}
sum+=num;
num+=2;
}
cout<<endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
256 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
3 ms |
376 KB |
Output is correct |
| 8 |
Correct |
3 ms |
376 KB |
Output is correct |
| 9 |
Correct |
3 ms |
504 KB |
Output is correct |
| 10 |
Correct |
3 ms |
504 KB |
Output is correct |
