# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
457702 | jurgis | Coins (LMIO19_monetos) | C++14 | 2087 ms | 1012 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 <iostream>
#include <bits/stdc++.h>
#define turbo() std::ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
int main()
{
int t; cin>>t;
for(int i=0; i<t; i++){
int n; cin>>n; int plac[n][n]; int k1, k2; cin>>k1>>k2; long long cnt = 0;
for(int a=0; a< n; a++){
for(int b=0; b<n; b++){
int c;
cin>>c;
if(a>=b){
plac[a][b] = 1;
}else{
plac[a][b]= 0;
}
}
}
for(int a=0; a< n; a++){
if(plac[a][a] ==1){
cnt++;
}
}
if(cnt<n/2){
for(int a=n-1; a>=n-cnt;){
if(plac[a][a]==0){
plac[a][a] = 1; a++;
}
}
}
else{
for(int a=n-1; a>=n-cnt;){
if(plac[a][a]==1){
plac[a][a] = 0; a++;
}
}
}
for(int a = 0; a< n; a++){
for(int b =0 ; b< n; b++){
cout<<plac[a][b]<< " ";
}
cout<<"\n";
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |