#include <iostream>
using namespace std;
int n, a[100][100];
int main()
{
cin>>n;
if(n == 1)
{
cout<<1<<endl;
return 0;
}
if(n == 2)
{
cout<<-1<<endl;
return 0;
}
for(int j = 0; j < n - 1; j++)
a[0][j] = j + 1;
a[0][n - 1] = n * (n - 1) / 2;
for(int i = 1; i < n - 1; i++)
for(int j = 0; j < n; j++)
a[i][j] = a[i - 1][j] + n * (n - 1) / 2;
for(int j = 0; j < n; j++)
{
a[n - 1][j] = (n - 1) * a[n - 2][j];
for(int i = 0; i < n - 2; i++)
a[n - 1][j] -= a[i][j];
}
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
cout<<a[i][j]<<" ";
cout<<endl;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 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 |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |