# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
91051 | YottaByte | Bank (IZhO14_bank) | C++14 | 0 ms | 0 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 <stdio.h>
using namespace std;
const int N = 1e5 + 1;
#define ll long long
#define ok puts("OK");
int n, m, x[N];
main()
{
scanf("%d %d", &n, &m);
scanf("%d", &x[i])
for(int i = 1; i <= n; i++)
{
int y; scanf("%d", y);
if(x[y])
{
puts("YES");
return 0;
}
}
puts("NO");
}