Pagini recente » Cod sursa (job #2915896) | Cod sursa (job #2797151) | Cod sursa (job #1610783) | Cod sursa (job #1705043) | Cod sursa (job #1546007)
#include <fstream>
#include <vector>
#define mod 666013
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector <int> v[mod];
int n;
void inserare(int a)
{
v[a%mod].push_back(a);
}
int exista(int a)
{
for(int i=0;i<v[a%mod].size();i++)
if(v[a%mod][i]==a)
return i;
return -1;
}
void stergere(int a)
{
v[a%mod].pop_back();
}
int main()
{
f>>n;
int x,t;
for(int i=1;i<=n;i++)
{
f>>t;
f>>x;
if(t==1)
inserare(x);
else
if(t==2)
{
if( exista(x)!=-1)
stergere(x);
}
else
g<<(exista(x)!=-1)<<"\n";
}
return 0;
}