# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
94151 | 2019-01-16T11:51:40 Z | ekrem | Prosjecni (COCI16_prosjecni) | C++ | 3 ms | 444 KB |
#include <bits/stdc++.h> #define st first #define nd second #define mp make_pair #define pb push_back #define N 105 using namespace std; int n, a[N][N]; int main() { // freopen("in.txt", "r", stdin); // freopen("out.txt", "w", stdout); scanf("%d",&n); if(n == 2){ puts("-1"); return 0; } if(n % 2){ for(int i = 1; i <= n; i++,puts("")) for(int j = 1; j <= n; j++) printf("%d ", (i - 1)*n + j); return 0; } for(int j = 1; j <= n; j++){ if(j == n/2) a[1][j] = a[1][j - 1] + 3; else a[1][j] = a[1][j - 1] + 1; } int ek = a[1][n]; for(int i = 2; i <= n; i++) for(int j = 1; j <= n; j++){ if(i == n/2) a[i][j] = a[i - 1][j] + 3*ek; else a[i][j] = a[i - 1][j] + ek; } for(int i = 1; i <= n; i++,puts("")) for(int j = 1; j <= n; j++) printf("%d ", a[i][j]); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 252 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Incorrect | 2 ms | 256 KB | Average condition doesn't hold. |
4 | Correct | 2 ms | 256 KB | Output is correct |
5 | Incorrect | 2 ms | 256 KB | Average condition doesn't hold. |
6 | Incorrect | 2 ms | 376 KB | Average condition doesn't hold. |
7 | Incorrect | 2 ms | 376 KB | Average condition doesn't hold. |
8 | Incorrect | 2 ms | 444 KB | Average condition doesn't hold. |
9 | Incorrect | 3 ms | 376 KB | Average condition doesn't hold. |
10 | Incorrect | 3 ms | 376 KB | Average condition doesn't hold. |