Cod sursa(job #2577588)
Utilizator | Data | 9 martie 2020 16:55:29 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <map>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
map <int,int> M;
int N;
int main()
{
f>>N;
while(N){
int op,x;
f>>op>>x;
if(op==1){
M[x]=1;
}else{
if(op==2){
M[x]=0;
}else{
g<<M[x]<<'\n';
}
}
N--;
}
f.close();
g.close();
return 0;
}