Cod sursa(job #2375905)
Utilizator | Papadia Mortala dacianoua | Data | 8 martie 2019 12:54:35 |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
#include <set>
#define mod 666013
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n;
set<int> h[mod];
int main()
{
fin>>n;
int z,x;
while(n--)
{
fin>>z>>x;
switch(z)
{
case 1:
h[x%mod].insert(x);
break;
case 2:
h[x%mod].erase(x);
break;
case 3:
if(h[x%mod].find(x)!=h[x%mod].end())
fout<<1<<"\n";
else
fout<<0<<"\n";
}
}
return 0;
}