Pagini recente » Cod sursa (job #2400378) | Cod sursa (job #1233407) | Utilizatori inregistrati la PreOJI 2017 | Cod sursa (job #3183848) | Cod sursa (job #2700495)
#include <iostream>
#include <fstream>
#include <vector>
const int MOD=86011;
std::vector<int> v[MOD];
std::ifstream in("hashuri.in");
std::ofstream out("hashuri.out");
int main()
{
int n, tip, x;
in>>n;
for(int i=1; i<=n; i++)
{
in>>tip>>x;
switch(tip)
{
case 1:
{
int loc=x%MOD;
for(int contor=0; contor<v[loc].size(); contor++)
{
if(v[loc][contor]==x)
{
break;
}
}
v[loc].push_back(x);
break;
}
case 2:
{
int loc=x%MOD;
for(int contor=0; contor<v[loc].size(); contor++)
{
if(v[loc][contor]==x)
{
v[loc].erase(v[loc].begin()+contor);
break;
}
}
break;
}
case 3:
{
int loc=x%MOD;
bool ok=0;
for(int contor=0; contor<v[loc].size(); contor++)
{
if(v[loc][contor]==x)
{
out<<1<<"\n";
ok=true;
}
}
if(ok==false)
{
out<<0<<"\n";
}
break;
}
}
}
}