oj.uz

답안 #147027

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
147027 2019-08-27T07:20:31 Z AXork Prosjecni (COCI16_prosjecni) C++14
120 / 120
 7 ms 504 KB 
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <cstring>

using namespace std;

int main() {
	
	int n;
	cin >>n;
	
	int brr;
	int br = 1;
	int mat[110][110];
	if (n == 2) {
		cout <<-1;
		return 0;
	}
	if (n%2 == 0) {
		for (int i=0; i<n-1; i++) {
			brr = 0;
			for (int j=0; j<n; j++) {
				if (j == n-1) {
					br = (br-1) * n - brr;
				}
				mat[i][j] = br;
				//cout <<br <<" ";
				brr+=br;
				br++;
			}
			//cout <<"\n";
		}
		int br = 0;
		for (int i=0; i<n; i++) {
			brr = 0;
			for (int j=0; j<n-1; j++) {
				brr+=mat[j][i];
				br = mat[j][i];
			}
			br = br * n - brr;
			mat[n-1][i] = br;
		}
	}
	else {
		for (int i=0; i<n; i++) {
			for (int j=0; j<n; j++) {
				cout <<br <<" ";
				br++;
			}
			cout <<"\n";
		}
		return 0;
	}
	
	for (int i=0; i<n; i++) {
		for (int j=0; j<n; j++) {
			cout <<mat[i][j] <<" ";
		}
		cout <<"\n";
	}
	
	return 0;
}

Subtask #1
120.0 / 120.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 1 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 2 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 7 ms 504 KB Output is correct