# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
590742 | Jakub_Wozniak | Coins (LMIO19_monetos) | C++14 | 17 ms | 936 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,K1,K2, N;
cin >> T >> N >> K1 >> K2;
int plansza[N+1][N+1];
for(int i=0;i<N;i++)
{
for(int j=0;j<N;j++)
{
cin >> plansza[i][j];
}
}
long long int wynik1=0,wynik2=0;
for(int i=0;i<N/2;i++)
{
for(int j=0;j<N;j++)
{
if(plansza[i][j]==1){ wynik1++;}
}
}
for(int i=0;i<N;i++)
{
for(int j=0;j<N/2;j++)
{
if(plansza[i][j]==1){ wynik2++;}
}
}
if(wynik1 < wynik2)
{
for(int i=0;i<N/2;i++)
{
for(int j=0;j<N;j++)
{
cout << "0 ";
}
cout << "\n";
}
for(int i=N/2;i<N;i++)
{
for(int j=0;j<N;j++)
{
cout << "1 ";
}
cout << "\n";
}
}
else
{
for(int i=0;i<N;i++)
{
for(int j=0;j<N/2;j++)
{
cout << "0 ";
}
for(int j=0;j<N/2;j++)
{
cout << "1 ";
}
cout << "\n";
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |