# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
98357 | dalgerok | Prosjecni (COCI16_prosjecni) | C++17 | 6 ms | 896 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;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n;
cin >> n;
int a[n + 1][n + 1];
for(int i = 1; i < n; i++){
a[1][i] = i;
}
a[1][n] = n * (n - 1) / 2;
for(int i = 2; i < n; i++){
for(int j = 1; j <= n; j++){
a[i][j] = a[i - 1][j] + n * (n - 1) / 2;
}
}
for(int j = 1; j <= n; j++){
int sum = 0;
for(int i = 1; i < n; i++){
sum += a[i][j];
}
a[n][j] = n * a[n - 1][j] - sum;
}
set < int > q;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
q.insert(a[i][j]);
}
}
if((int)q.size() != n * n){
cout << "-1";
}
else{
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
cout << a[i][j] << " ";
}
cout << "\n";
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |