Pagini recente » Cod sursa (job #2750121) | Cod sursa (job #326229) | Cod sursa (job #1459395) | Cod sursa (job #2646458) | Cod sursa (job #2282601)
#include <fstream>
#include <vector>
#define MOD 666013
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n,i,oper,val;
vector <int> v[MOD];
vector <int>::iterator it;
vector <int>::iterator cauta(int x)
{
vector <int>::iterator i=v[x%MOD].begin();
for(;i!=v[x%MOD].end();i++)
if(*i==x)
{
return i;
}
return v[x%MOD].end();
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>oper>>val;
it=cauta(val);
if(oper==1)
if(it==v[val%MOD].end())
v[val%MOD].push_back(val);
if(oper==2)
if(it!=v[val%MOD].end())
v[val%MOD].erase(it);
if(oper==3)
if(it==v[val%MOD].end())
g<<"0 \n";
else
g<<"1 \n";
}
}