Pagini recente » Cod sursa (job #1192769) | Cod sursa (job #1473422) | Cod sursa (job #702800) | Cod sursa (job #176855) | Cod sursa (job #1523334)
#include <fstream>
using namespace std;
const int p1 = 666013, p2 = 666019, p3 = 666023;
short v[666013], u[666019], k[666023];
int main(){
ifstream in("hasuri.in");
int n, q;
ofstream out("hashuri.out");
char c;
in >> n;
while (n--){
in >> c >> q;
switch(c){
case '1':
v[q % p1]++;
u[q % p2]++;
k[q % p3]++;
break;
case '2':
if (v[q % p1] && u[q % p2] && k[q % p3]){
v[q % p1]--;
u[q % p2]--;
k[q % p3]--;
}
break;
case '3':
if (v[q % p1] && u[q % p2] && k[q % p3]){
out << "1\n";
}
else
out << "0\n";
break;
}
}
in.close();
out.close();
return 0;
}