oj.uz

답안 #147128

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
147128 2019-08-27T15:29:30 Z Filip Prosjecni (COCI16_prosjecni) C++14
120 / 120
 3 ms 504 KB 
#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;
}

Subtask #1
120.0 / 120.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 376 KB Output is correct