Cod sursa(job #1735908)
| Utilizator | Data | 31 iulie 2016 16:58:20 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
int a[1003],n,i,tip,x,k,j,ok;
int main() {
in>>n;
for(i=1;i<=n;i++){
in>>tip>>x;
if(tip==1)
a[++k]=x;
if(tip==2){
for(j=1;j<=k;j++){
if(x==a[j])
a[j]=-1;
}
}
if(tip==3){
for(j=1;j<=k;j++){
if(x==a[j])
ok=1;
else
ok=0;
}
if(ok==1)
out<<"1"<<"\n";
else
out<<"0"<<"\n";
}
}
return 0;
}
