# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
786125 | vjudge1 | Coins (LMIO19_monetos) | C++17 | 8 ms | 980 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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(i+j<n-1){
cout << "0";
}else if(i+j>n-1){
cout << "1";
}else{
if(i<n/2){
cout << "0";
}else{
cout << "1";
}
}
}
cout << endl;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |