Pagini recente » Cod sursa (job #1983142) | Cod sursa (job #1959154) | Cod sursa (job #262774) | Cod sursa (job #2822494) | Cod sursa (job #2642430)
#include<iostream>
#include<vector>
#include<fstream>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector<int>L[1002];
int n,val;
void inserare(int val)
{
int key=val%1001;
L[key].push_back(val);
}
void stergere(int val)
{
int key=val%1001;
for(int i=0;i<L[key].size();i++)
{
if(L[key][i]==val)
{
L[key][i]=L[key][L[key].size()-1];
L[key].pop_back();
}
}
}
int cautare(int val)
{
int key=val%1001;
for(int i=0;i<L[key].size();i++)
{
if(L[key][i]==val)
return 1;
}
return 0;
}
void citire()
{
f>>n;
for (int i=1;i<=n;i++)
{
int cer;
f>>cer;
f>>val;
if(cer==1)
{
if(cautare(val)==0)
inserare(val);
}
else if(cer==2)
{
if(cautare(val)==1)
stergere(val);
}
else if(cer==3)
{
if(cautare(val))
g<<"1"<<"\n";
else
g<<"0"<<"\n";
}
}
}
int main()
{
citire();
return 0;
}