Pagini recente » Cod sursa (job #1849702) | Cod sursa (job #2947099) | Cod sursa (job #2457270) | Istoria paginii runda/concurs_aaa/clasament | Cod sursa (job #2204458)
#include <iostream>
#include <fstream>
#include <map>
#include <unordered_map>
#include <string.h>
using namespace std;
int n, y, o;
unordered_map<int, bool> myMap;
char sir[15];
int idx;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
void GetInt(int &t) {
t = 0;
while (isdigit(sir[idx])) {
t *= 10;
t += (int)sir[idx] - '0';
idx++;
}
idx++;
}
int main()
{
int i, j;
fin >> n;
fin.get();
for (i = 1; i <= n; i++) {
//fin >> o >> y;
idx = 0;
fin.getline(sir, 15);
GetInt(o);
GetInt(y);
if (o == 1) {
myMap[y] = true;
} else if (o == 2) {
myMap[y] = false;
} else {
fout << myMap[y] << '\n';
}
}
return 0;
}