oj.uz

답안 #98357

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
98357 2019-02-22T18:28:50 Z dalgerok Prosjecni (COCI16_prosjecni) C++17
120 / 120
 6 ms 896 KB 
#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";
        }
    }
}

Subtask #1
120.0 / 120.0

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