#include <bits/stdc++.h>
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
const int N = 101;
int n, a[N][N], sum[N];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif // LOCAL
cin >> n;
for (int i = 0; i < n - 1; i++){
a[0][i] = i + 1;
sum[i] += a[0][i];
}
a[0][n - 1] = n * (n - 1) / 2;
sum[n - 1] += 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] + n * (n - 1) / 2;
sum[j] += a[i][j];
}
}
// for (int i = 0; i < n; i++) cout << sum[i] << " "; cout << "\n";
for (int j = 0; j < n; j++)
a[n - 1][j] = a[n - 2][j] * n - sum[j];
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++) cout << a[i][j] << " ";
cout << "\n";
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
7 |
Correct |
6 ms |
384 KB |
Output is correct |
8 |
Correct |
5 ms |
384 KB |
Output is correct |
9 |
Correct |
6 ms |
384 KB |
Output is correct |
10 |
Correct |
7 ms |
384 KB |
Output is correct |