Pagini recente » Cod sursa (job #758726) | Cod sursa (job #768226) | Cod sursa (job #579157) | Cod sursa (job #3286611) | Cod sursa (job #634704)
Cod sursa(job #634704)
#include<fstream>
#include<iostream>
#include<vector>
#include<set>
using namespace std;
#define m 200003
int n;
int hash[m][15];
int main(){
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int a,b,i,j;
f>>n;
for(i=1;i<=n;i++){
f>>a>>b;
if(a==1){
a=b%m;
int ct=hash[a][0]+1;
for(j=1;j<=hash[a][0];j++)
if(b==hash[a][j]){
ct=-1;
j=hash[a][0]+1;
}
if(ct==-1){}
else{
hash[a][0]++;
hash[a][hash[a][0]]=b;
}
}
else{
if(a==2){
a=b%m;
int ct=hash[a][0]+1;
for(j=1;j<=hash[a][0];j++){
if(b==hash[a][j])
ct=j;
if(j>=ct)
hash[a][j]=hash[a][j+1];
}
hash[a][0]--;
}
else{
a=b%m;
int ct=hash[a][0]+1;
for(j=1;j<=hash[a][0];j++)
if(b==hash[a][j]){
g<<"1\n";
ct=-1;
j=hash[a][0]+1;
}
if(ct!=-1)
g<<"0\n";
}
}
}
return 0;
}