Pagini recente » Rezultatele filtrării | Rezultatele filtrării | Cod sursa (job #906831)
Cod sursa(job #906831)
#include<fstream>
#include<vector>
#define mod 666013
using namespace std;
unsigned long n,x,y,i;
vector<unsigned long>a[mod+5];
int find(int x)
{
int poz,i;
poz=x%mod;
for(i=0;i<a[poz].size();++i)
if(a[poz][i]==x)
return i;
return-1;
}
void insert(int x)
{
int poz=x%mod;
a[poz].push_back(x);
}
void erase(int x)
{
int poz,i;
poz=x%mod;
i=find(x);
a[poz].erase(a[poz].begin()+i);
}
int main()
{
ifstream f("hashuri.in");
ofstream g("hashuri.out");
f>>n;
for(;n;--n)
{
f>>x>>y;
if(x==1&&find(y)==-1)
insert(y);
if(x==2)
erase(y);
if(x==3)
g<<(find(y)!=-1)<<"\n";
}
return 0;
}