Pagini recente » Cod sursa (job #2285254) | Cod sursa (job #2067861) | Cod sursa (job #1584573) | Cod sursa (job #1757299) | Cod sursa (job #1968031)
#include <fstream>
#include <vector>
#include <algorithm>
#define MOD 9973
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int i,n,x,y;
vector <int> H[10000];
int main()
{
f>>n;
for(i=1;i<=n;i++){
f>>x>>y;
if(x==1)
H[y%MOD].push_back(y);
if(x==2){
if(find(H[y%MOD].begin(),H[y%MOD].end(),y)!=H[y%MOD].end())
H[y%MOD].erase(find(H[y%MOD].begin(),H[y%MOD].end(),y));
}
if(x==3){
if(find(H[y%MOD].begin(),H[y%MOD].end(),y)!=H[y%MOD].end())
g<<1<<'\n';
else
g<<0<<'\n';
}
}
return 0;
}