Pagini recente » Cod sursa (job #3239604) | Cod sursa (job #508761) | Cod sursa (job #177341) | Cod sursa (job #2893413) | Cod sursa (job #2035280)
#include <fstream>
#include <map>
using namespace std;
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
const int maxim = 666013;
map <int, int> f[maxim+1];
int main()
{
int n, op;
long long x;
fin>>n;
while ( n-- )
{
fin>>op>>x;
int h = x % maxim;
if ( op == 1 )
{
if ( f[x][h] == 0 )
f[x][h] = 1;
}
if ( op == 2 )
{
if ( f[x][h] != 0 )
f[x][h] = 0;
}
if ( op == 3 )
{
if ( f[x][h] != 0 )
fout<<"1"<<'\n';
else
fout<<"0"<<'\n';
}
}
}