AcWing 3542. 查找
原题链接
简单
作者:
寻路
,
2022-07-12 13:35:52
,
所有人可见
,
阅读 204
暴力出奇迹
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int main()
{
int n,m;
scanf("%d",&n);
int arr1[n];
for (int i = 0; i < n; i ++ ) {
scanf("%d",&arr1[i]);
}
scanf("%d",&m);
int arr2[m];
for (int i = 0; i < m; i ++ ) {
scanf("%d",&arr2[i]);
}
for (int i = 0; i < m; i++ ) {
bool flag = false;
for (int j = 0; j < n; j++) {
if (arr2[i] == arr1[j]) {
printf("YES\n");
flag = true;
break;
}
}
if (flag == false) printf("NO\n");
}
return 0;
}