# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
242544 | NONAME | Prosjecni (COCI16_prosjecni) | C++14 | 7 ms | 1024 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>
using namespace std;
using ll = long long;
using ld = long double;
ll a[101][101];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll n;
cin >> n;
ll sum = n * (n - 1) / 2;
for (int i = 0; i < n - 1; ++i)
a[0][i] = i + 1;
a[0][n - 1] = sum;
for (int i = 1; i < n; ++i)
for (int j = 0; j < n; ++j)
a[i][j] = a[i - 1][j] + sum;
set <ll> s;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
s.insert(a[i][j]);
if (int(s.size()) != n * n) {
cout << "-1\n";
return 0;
}
for (int i = 0; i < n; ++i, cout << "\n")
for (int j = 0; j < n; ++j)
cout << a[i][j] << " ";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |