#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
int n; cin>>n;
if(n==2) cout<<-1<<endl;
else if(n%2==1)
{
for(int i=0; i<n; i++)
{
for(int l=1; l<=n; l++)
{
cout<<i*n+l<<" ";
}
cout<<"\n";
}
}
else
{
vector<int> a(n);
a[0]=n;
a[1]=n-3;
a[2]=n+1;
a[3]=n+2;
int p=4;
for(int i=4; i<n; i++)
{
a[i]=n+p;
a[i+1]=n-p;
p++;
i++;
}
set<int> st;
for(int i=0; i<n-1; i++)
{
for(int l=0; l<n; l++)
{
cout<<n*2+a[l]<<" ";
a[l]=n*2+a[l];
st.insert(a[l]);
}
cout<<"\n";
}
int add=n*2*(((n-2)*(n-1))/2);
for(auto l: a)
{
cout<<l+add<<" ";
st.insert(l+add);
}
if(st.size()!=n*n) cout<<"aa\n"<<st.size();
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
244 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
468 KB |
Output is correct |
8 |
Correct |
2 ms |
724 KB |
Output is correct |
9 |
Correct |
2 ms |
724 KB |
Output is correct |
10 |
Correct |
2 ms |
724 KB |
Output is correct |