Pagini recente » Cod sursa (job #10715) | Cod sursa (job #481984) | Cod sursa (job #1395185) | Cod sursa (job #545653) | Cod sursa (job #2791120)
#include <fstream>
#define mod 2007329
#define mod2 2007697
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
int n,op,x;
int v[mod], v2[mod2];
int gcd(int a,int b){
return b==0?a:gcd(b,a%b);
}
int main() {
cin >> n;
for(int i=1;i<=n;i++){
cin>>op>>x;
switch(op){
case 1:
v[x%mod]=1;
v2[x%mod2]=1;
break;
case 2:
v[x%mod]=0;
v2[x%mod2]=0;
break;
case 3:
cout<<(v[x%mod]*v2[x%mod2])<<'\n';
break;
}
}
// if (m[10] == 3)
//
// if (m.find(10) != m.end())
// if (m[10] == 3)
//
// for (auto it : m) {
// it.first -> key
// it.second -> value
// }
// for (auto it = m.begin(); it != m.end(); ++it)
// it -> first //-> key
// it -> second //val
return 0;
}