oj.uz

답안 #623552

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
623552 2022-08-05T20:42:25 Z inksamurai Prosjecni (COCI16_prosjecni) C++17
24 / 120
 1 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define _3SgiE60 ios::sync_with_stdio(0),cin.tie(0)
// e

const int _n=111;

signed main(){
_3SgiE60;
	int n;
	cin>>n;
	int a[_n][_n];
	if(n%2==0){
		if(n==2){
			printf("-1\n");
			return 0;
		}
		rep(i,n){
			rep(j,n) if(j)a[i][j]=(j%2?1:-1)*(j+1)/2;
			a[i][n-1]*=-1;
			a[i][1]+=n/2;
			rep(j,n) a[i][j]+=n+i*n*2;
		}
	}else{
		rep(i,n){
			rep(j,n) a[i][j]=i*n+j+1;
		}
	}
	rep(i,n){
		int sun=0;
		rep(j,n) sun+=a[i][j];
		rep(j,n) printf("%d ", a[i][j]);
		puts("");
		// if(sun%n){
		// 	// printf("sad %d %d\n",sun,i);
		// 	return 0;
		// }
	}
}

Subtask #1
24.0 / 120.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 340 KB Average condition doesn't hold.
2 Correct 0 ms 340 KB Output is correct
3 Incorrect 0 ms 340 KB Average condition doesn't hold.
4 Correct 0 ms 340 KB Output is correct
5 Incorrect 0 ms 340 KB Average condition doesn't hold.
6 Incorrect 0 ms 340 KB Average condition doesn't hold.
7 Incorrect 1 ms 340 KB Average condition doesn't hold.
8 Incorrect 1 ms 340 KB Average condition doesn't hold.
9 Incorrect 1 ms 340 KB Average condition doesn't hold.
10 Incorrect 1 ms 340 KB Average condition doesn't hold.