#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int a[5]={2,4,7,1,5};
int b[3]={5,4,2};
unordered_set<int>m;
for(int i=0;i<5;i++){
m.insert(a[i]);
}
for(int i=0;i<3;i++){
if(m.count(b[i])==0){
cout<<"there exist subarray";
}
else{
cout<<"there does not exit subarray";
}
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgYVs1XT17Miw0LDcsMSw1fTsKCWludCBiWzNdPXs1LDQsMn07Cgl1bm9yZGVyZWRfc2V0PGludD5tOwoJZm9yKGludCBpPTA7aTw1O2krKyl7CgkJbS5pbnNlcnQoYVtpXSk7Cgl9Cglmb3IoaW50IGk9MDtpPDM7aSsrKXsKCQlpZihtLmNvdW50KGJbaV0pPT0wKXsKCQkgICAgICBjb3V0PDwidGhlcmUgZXhpc3Qgc3ViYXJyYXkiOwoJICAgICB9CgkgICAgIGVsc2V7CgkgICAgIAljb3V0PDwidGhlcmUgZG9lcyBub3QgZXhpdCBzdWJhcnJheSI7CgkgICAgIH0KIAoJfQogCglyZXR1cm4gMDsKfQ==