Cod sursa(job #549786)
| Utilizator | Data | 8 martie 2011 22:21:42 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#define hash_size 998998
#include<fstream>
#include<cmath>
using namespace std;
int h(int val){return (int)(sqrt(val)+val/2)%hash_size;}
int main(){
int n,d1,d2;
int table[hash_size];
for(int i=0;i<hash_size;i++)table[i]=0;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
f>>n;
for(int i=0;i<n;i++){
f>>d1>>d2;
if(d1==1)table[h(d2)]=d2;
if(d1==2)table[h(d2)]=0;
if(d1==3&&table[h(d2)]==0)g<<"0\n";
if(d1==3&&table[h(d2)]!=0)g<<"1\n";}
f.close();g.close();
return 0;}
