# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
102292 | 2019-03-24T07:15:04 Z | SirCeness | Prosjecni (COCI16_prosjecni) | C++14 | 5 ms | 512 KB |
#include <bits/stdc++.h> #define mod 1000000007 typedef long long ll; using namespace std; int n; int mat[100][100]; int arr[100]; int main(){ //freopen("baskent.gir", "r", stdin); cin >> n; if (n == 1){ cout << "1" << endl; return 0; } else if (n == 2){ cout << "-1" << endl; return 0; } for (int i = 0; i < n-1; i++){ arr[i] = i+1; } arr[n-1] = (n-1)*(n-1) - (n-2)*(n-1)/2; for (int i = 0; i < n; i++) cout << arr[i] << " "; cout << endl; for (int i = 0; i < n; i++){ for (int j = 0; j < n; j++){ mat[i][j] = arr[i]*10000; } } for (int i = 0; i < n; i++){ for (int j = 0; j < n; j++){ mat[i][j] += arr[j]; } } for (int i = 0; i < n; i++){ for (int j = 0; j < n; j++){ cout << mat[i][j] << " "; } cout << endl; } cout << endl; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 364 KB | Average condition doesn't hold. |
2 | Incorrect | 2 ms | 384 KB | Extra information in the output file |
3 | Incorrect | 3 ms | 460 KB | Average condition doesn't hold. |
4 | Incorrect | 2 ms | 384 KB | Extra information in the output file |
5 | Incorrect | 2 ms | 384 KB | Average condition doesn't hold. |
6 | Incorrect | 2 ms | 384 KB | Average condition doesn't hold. |
7 | Incorrect | 3 ms | 384 KB | Average condition doesn't hold. |
8 | Incorrect | 3 ms | 384 KB | Average condition doesn't hold. |
9 | Incorrect | 3 ms | 384 KB | Average condition doesn't hold. |
10 | Incorrect | 5 ms | 512 KB | Average condition doesn't hold. |