Pagini recente » Cod sursa (job #3042315) | Cod sursa (job #2344339) | Cod sursa (job #1254985) | Cod sursa (job #1336588) | Cod sursa (job #1582549)
#include <fstream>
#include <vector>
#define MOD 2531
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int N;
int a,b,c;
vector <int> H[MOD];
int main(){
fin >> N;
while(N--){
fin >> a >> b;
if(a==1){
int gasit = 0;
c=b%MOD;
for(int i=0;i<H[c].size();i++)
if(H[c][i]==b){
gasit=1;
break;
}
if(!gasit)
H[c].push_back(b);
}
if(a==2){
c=b%MOD;
int poz=-1;
for(int i=0;i<H[c].size();i++)
if(H[c][i]==b){
poz=i;
break;
}
if(poz>=0)
H[c].erase(H[c].begin()+poz);
}
if(a==3){
c=b%MOD;
int gasit=0;
for(int i=0;i<H[c].size();i++)
if(H[c][i]==b){
gasit=1;
break;
}
fout << gasit << "\n";
}
}
}