Pagini recente » Cod sursa (job #240826) | Cod sursa (job #2027997) | Cod sursa (job #1850355) | Cod sursa (job #2917146) | Cod sursa (job #1740446)
#include <fstream>
#include <vector>
#define MOD 666013
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int N;
vector<int> G[MOD];
inline int isThere(int x)
{
int key=x%MOD;
for(int i=0;i<G[key].size();i++) if(G[key][i]==x) return 1;
return 0;
}
inline void insertV(int x)
{
int key=x%MOD;
if(!isThere(x)) G[key].push_back(x);
}
inline void removeV(int x)
{
int key=x%MOD;
for(int i=0;i<G[key].size();i++) if(G[key][i]==x)
{
G[key].erase(G[key].begin()+i) ;
break ;
}
}
int main()
{
int op, x;
f>>N;
while(N)
{
--N;
f>>op>>x;
if (op == 1)
{
insertV(x);
continue;
}
if (op == 2)
{
removeV(x);
continue;
}
g<<isThere(x)<<'\n';
}
return 0;
}