Pagini recente » Cod sursa (job #1404756) | Cod sursa (job #601365) | Cod sursa (job #1754488) | Cod sursa (job #2787322) | Cod sursa (job #2374762)
#include <fstream>
#include <vector>
#define MAX 3010
#define MOD 666013
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
vector<int> tabladehas[MOD + 10];
int ok, rest, x, operatii, n;
int main()
{
int i, j;
fin >> operatii;
for(i=1; i<=operatii; i++)
{
fin >> x >> n;
rest = n % MOD;
ok = 0;
for(j=0; j<tabladehas[rest].size(); j++)
if(tabladehas[rest][j] == n)
{
ok = 1;
break;
}
if(x == 1 && !ok)
tabladehas[rest].push_back(n);
else if(x == 2 && ok)
{
swap(tabladehas[rest][j], tabladehas[rest][tabladehas[rest].size() - 1]);
tabladehas[rest].pop_back();
}
else if(x == 3)
{
if(ok) fout << 1 << '\n';
else fout << 0 << '\n';
}
}
return 0;
}