Cod sursa(job #2242500)
Utilizator | Pintea Teodor Stefan pinteastefan | Data | 18 septembrie 2018 19:55:50 |
---|---|---|---|
Problema | Hashuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
# define MOD = 666013;
int v[1000001];
int main() {
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n, x, op;
f >> n;
for (int i = 1; i <= n; i++) {
f >> op >> x;
if ( op == 1){
v[x % MOD] = 1;
}
else if(op == 2 && v[x % MOD] == 1){
v[x % MOD] = 0;
}
else if( op == 3){
if( v[x % MOD] == 1){
g << 1 << "\n";
}
else {
g << 0 << " \n";
}
}
}
return 0;
}