Cod sursa(job #3001435)
Utilizator | Data | 13 martie 2023 17:27:06 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
unordered_map<long long,bool>um;
int n , op , a;
int main(){
cin >> n;
while(n--){
cin >> op >> a;
if(op == 1) um[a] = 1;
if(op == 2) um[a] = 0;
if(op == 3) cout << um[a] << '\n';
}
return 0;
}