Pagini recente » Cod sursa (job #184244) | Cod sursa (job #1121809) | Cod sursa (job #2612620) | Cod sursa (job #1586341) | Cod sursa (job #2953241)
#include <fstream>
#include <vector>
#define p1 666013
#define p2 32767
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
vector <int> f[p1];
int n, a, t;
bool found = false;
int main()
{
in>>n;
for(int i=1; i<=n; i++)
{
found = false;
in>>t>>a;
if(t == 1)
{
f[a%p1].push_back(a);
}
else
if(t==2)
{
for(int j=0; j<(int)f[a%p1].size(); j++)
{
if(f[a%p1][j] == a)
{
swap(f[a%p1][j], f[a%p1][(int)f[a%p1].size()-1]);
f[a%p1].pop_back();
}
}
}
else
{
if(t ==3)
{
for(int j=0; j<(int)f[a%p1].size(); j++)
{
//out<<f[a%p1][j]<<"| ";
if(f[a%p1][j] == a)
{
found = true;
}
}
if(found == true)
{
out<<"1\n";
}
else
out<<"0\n";
}
}
}
return 0;
}