Cod sursa(job #2107518)
Utilizator | Data | 17 ianuarie 2018 13:48:38 | |
---|---|---|---|
Problema | Hashuri | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
#define MOD 5707301
int a[500001];
int main()
{
int n,p,x;
f>>n;
for(int i=1;i<=n;i++)
{
f>>p>>x;
if(p==1){if(a[x%MOD]==0)a[x%MOD]=1;}
else if(p==2){if(a[x%MOD]==1)a[x%MOD]=0;}
else g<<a[x%MOD]<<'\n';
}
return 0;
}