| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 99860 | IvanBevanda | Baza (COCI17_baza) | C++17 | 109 ms | 8012 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 N, M, Q, Truth=1, z=0;
int main()
{
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  
  cin >> N >> M;
  int A[N][M];
  for (int i=0;i<N;++i){
  	for (int j=0;j<M;++j) cin >> A[i][j];
  }
  cin >> Q;
  int B[Q][M];
  for (int i=0;i<Q;++i){
  	for (int j=0;j<M;++j) cin >> B[i][j];
  }
  for (int i=0;i<Q;++i){
  	for (int j=0;j<N;++j){
  		for (int f=0;f<M;++f){
  			if (B[i][f] != A[j][f] && B[i][f] != -1) Truth = 0;
		  }
		if (Truth == 1) ++z;
		Truth = 1;
	  }
	cout << z << endl;
	z=0;
  }
  return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
