# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
147128 | Filip | Prosjecni (COCI16_prosjecni) | C++14 | 3 ms | 504 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],sr = 0;
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,po,z,ss = 0;
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 j = 0;j < n - 1;j++){
sr += M[0][j];
}
M[0][n - 1] = M[0][n / 2] * n - sr;
z = M[0][n - 1];
po = M[0][n - 1] - M[0][n - 2];
for (int i = 1;i < n -1;i++){
for (int j = 0;j < n -1;j++){
z += 1;
M[i][j] = z;
}
z += po;
M[i][n - 1] = z;
}
for (int i = 0;i < n - 1;i++){
ss += M[i][0];
}
M[n - 1][0] = M[n / 2][0] * n - ss;
z = M[n - 1][0];
for (int j = 1;j < n -1;j++){
z += 1;
M[n - 1][j] = z;
}
z += po;
M[n - 1][n - 1] = z;
ispis_matrice(n);
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |