# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
786128 | 2023-07-18T04:22:27 Z | vjudge1 | Coins (LMIO19_monetos) | C++17 | 10 ms | 852 KB |
#include<bits/stdc++.h> using namespace std; int t, n, k1, k2; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> t >> n >> k1 >> k2; int grid[n][n], res[n][n]; for(int i=0; i<n; i++){ for(int j=0; j<n; j++){ cin >> grid[i][j]; } } for(int i=0; i<n; i++){ for(int j=0; j<n; j++){ if(j) cout << " "; if(j<n/2){ cout << "0"; }else{ cout << "1"; } } cout << endl; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | K = 25 |
2 | Incorrect | 1 ms | 212 KB | K = 648 |
3 | Incorrect | 10 ms | 800 KB | K = 21146 |
4 | Partially correct | 7 ms | 736 KB | K = 23239 |
5 | Partially correct | 7 ms | 784 KB | K = 18430 |
6 | Partially correct | 7 ms | 724 KB | K = 22273 |
7 | Incorrect | 8 ms | 724 KB | K = 22837 |
8 | Partially correct | 7 ms | 852 KB | K = 20045 |
9 | Partially correct | 8 ms | 852 KB | K = 21031 |
10 | Incorrect | 10 ms | 724 KB | K = 22645 |