# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
147101 | Filip | Prosjecni (COCI16_prosjecni) | C++14 | 3 ms | 508 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 <iostream>
using namespace std;
int M[105][105],Z[105];
void neparna_matrica(int x){
for(int i = 0;i < x;i++){
for (int j = 0;j < x;j++){
M[i][j] = i * x + j + 1;
}
}
}
void ispis_matrice(int x){
for(int i = 0;i < x;i++){
for (int j = 0;j < x;j++){
cout << M[i][j] << " ";
}
cout << endl;
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
if (n == 2) cout << -1;
else if (n % 2 == 1){
neparna_matrica(n);
ispis_matrice(n);
}
else{
neparna_matrica(n -1);
for (int i = 1;i < n -1;i++){
for (int j = 0;j < n - 1;j++){
M[i][j] += i * (n - 1);
}
}
for (int i = 0;i < n -1;i++){
M[i][n - 1] = M[i][n - 2] + n - 1;
}
for (int j = 0; j < n;j++){
for (int i = 0;i < n - 1;i++){
Z[j] += M[i][j];
}
}
for (int j = 0;j < n;j++){
M[n - 1][j] = M[n - 2][j] * n - Z[j];
}
ispis_matrice(n);
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |