Pagini recente » Cod sursa (job #839018) | Cod sursa (job #2212256) | Cod sursa (job #136050) | Cod sursa (job #785476) | Cod sursa (job #1309460)
# include <fstream>
# include <vector>
# include <algorithm>
# define mod 15003
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector <int> v[mod];
int i,j,n,r,x,tip;
int main ()
{
f>>n;
for (i=1; i<=n; ++i)
{
f>>tip>>x;
r=x%mod;
if (tip==1) //inserare
{
if (find(v[r].begin(), v[r].end(), x)==v[r].end())
v[r].push_back(x);
}
if (tip==2) //sterg
{
if (find(v[r].begin(), v[r].end(), x)!=v[r].end())
v[r].erase(find(v[r].begin(), v[r].end(), x));
}
if (tip==3)
{
if (find(v[r].begin(), v[r].end(), x)!=v[r].end()) g<<"1\n";
else g<<"0\n";
}
}
return 0;
}