# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
457411 | Kipras | Coins (LMIO19_monetos) | C++17 | 44 ms | 608 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 main()
{
int t, n, k, k2, top, left, temp;
cin>>t>>n>>k>>k2;
for(int i = 1; i <= n; i++){
for(int x = 1; x <= n; x++){
cin>>temp;
if(i<=n/2&&!temp){
top++;
}else if(x<=n/2&&!temp){
left++;
}
}
}
if(top>left){
for(int i = 1; i <= n/2; i++){
for(int x = 1; x <= n; x++){
cout<<0<<" ";
}
cout<<'\n';
}
for(int i = n/2+1; i <= n; i++){
for(int x = 1; x <= n; x++){
cout<<1<<" ";
}
cout<<'\n';
}
}else{
for(int i = 1; i <= n; i++){
for(int x = 1; x <= n/2; x++){
cout<<0<<" ";
}
for(int x = n/2+1; x <= n; x++){
cout<<1<<" ";
}
cout<<'\n';
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |