Cod sursa(job #2632956)
Utilizator | Data | 5 iulie 2020 18:51:00 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
unordered_map <int,bool> ma[106973];
int n,i,a,b;
int main()
{
in>>n;
for (i=1;i<=n;++i)
{
in>>a>>b;
if (a==1) ma[b%96973][b]=1;
if (a==2) ma[b%96973][b]=0;
if (a==3) out<<ma[b%96973][b]<<'\n';
}
return 0;
}