# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
457654 | jurgis | Coins (LMIO19_monetos) | C++14 | 40 ms | 372 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; bool 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(c==1){plac[a][b] = true;}else{ plac[a][b] = false;}
if(b>=5 && !plac[a][b]){
cnt++;
}
}
}
cout<<cnt;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |