Cod sursa(job #1418042)
Utilizator | Data | 11 aprilie 2015 19:45:50 | |
---|---|---|---|
Problema | Hashuri | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <iostream>
#include <bitset>
using namespace std;
ifstream f ("hashuri.in");
ofstream o ("hashuri.out");
int main() {
int i,ii,j,n;
bitset<1000001>v;
f>>n;
for(i=1;i<=n;i++){
f>>ii; f>>j;
if(ii==1) {
v[j]=1;
}
if(ii==2) {
v[j]=0;
}
if(ii==3) {
if(v[j]==1) {
o<<1<<'\n';
} else {
o<<0<<'\n';
}
}
}
o.close();
f.close();
return 0;
}