Cod sursa(job #3291575)
Utilizator | Data | 5 aprilie 2025 09:54:51 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n;
unordered_map<int, int> fr;
int main()
{
f >> n;
for(int i = 1; i <= n; i ++)
{
int tip, x; f >> tip >> x;
if(tip == 1)
fr[x] = 1;
else if(tip == 2)
fr[x] = 0;
else
g << fr[x] << '\n';
}
return 0;
}