Pagini recente » Cod sursa (job #1877318) | Cod sursa (job #2533981) | Cod sursa (job #3184428) | Cod sursa (job #1492917) | Cod sursa (job #2735221)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector <int> v[999983];
const int mod=999983;
bool check(int val)
{
int poz=val%mod;
for(int i=0;i<v[poz].size();i++)
if(v[poz][i]==val)
return true;
return false;
}
void add(int val)
{
int poz=val%mod;
if(!check(val))
v[poz].push_back(val);
}
void del(int val)
{
int poz=val%mod;
for(int i=0;i<v[poz].size();i++)
if(v[poz][i]==val){
v[poz][i]=-1;
return;
}
}
int main()
{ int n,caz,x;
f>>n;
for(int i=1;i<=n;i++){
f>>caz>>x;
if(caz==1) add(x);
if(caz==2) del(x);
if(caz==3) g<<check(x)<<endl;
}
return 0;
}