题目链接：http://codeforces.com/contest/714/problem/C
题意：T个询问，+,-,?，+代表往一个集合里放一个数，-代表删掉一个。?表示询问这个集合里有多少个数符合一个pattern，pattern是个01串，0代表对应某一位数是个偶数，1代表对应某一位是奇数。
直接把对应的字符串全部转换成pattern形式放到map里维护一下。
1 /* 2 ━━━━━┒ギリギリ♂ eye！ 3 ┓┏┓┏┓┃キリキリ♂ mind！ 4 ┛┗┛┗┛┃＼○／ 5 ┓┏┓┏┓┃ / 6 ┛┗┛┗┛┃ノ) 7 ┓┏┓┏┓┃ 8 ┛┗┛┗┛┃ 9 ┓┏┓┏┓┃ 10 ┛┗┛┗┛┃ 11 ┓┏┓┏┓┃ 12 ┛┗┛┗┛┃ 13 ┓┏┓┏┓┃ 14 ┃┃┃┃┃┃ 15 ┻┻┻┻┻┻ 16 */ 17 #include <algorithm> 18 #include <iostream> 19 #include <iomanip> 20 #include <cstring> 21 #include <climits> 22 #include <complex> 23 #include <cassert> 24 #include <cstdio> 25 #include <bitset> 26 #include <vector> 27 #include <deque> 28 #include <queue> 29 #include <stack> 30 #include <ctime> 31 #include <set> 32 #include <map> 33 #include <cmath> 34 using namespace std; 35 #define fr first 36 #define sc second 37 #define cl clear 38 #define BUG puts("here!!!") 39 #define W(a) while(a--) 40 #define pb(a) push_back(a) 41 #define Rint(a) scanf("%d", &a) 42 #define Rs(a) scanf("%s", a) 43 #define FRead() freopen("in", "r", stdin) 44 #define FWrite() freopen("out", "w", stdout) 45 #define Rep(i, len) for(int i = 0; i < (len); i++) 46 #define For(i, a, len) for(int i = (a); i < (len); i++) 47 #define Cls(a) memset((a), 0, sizeof(a)) 48 #define Clr(a, x) memset((a), (x), sizeof(a)) 49 #define Full(a) memset((a), 0x7f7f7f, sizeof(a)) 50 #define lrt rt << 1 51 #define rrt rt << 1 | 1 52 #define pi 3.14159265359 53 #define RT return 54 #define lowbit(x) x & (-x) 55 #define onenum(x) __builtin_popcount(x) 56 typedef long long LL; 57 typedef long double LD; 58 typedef unsigned long long ULL; 59 typedef pair<int, int> pii; 60 typedef pair<string, int> psi; 61 typedef pair<LL, LL> pll; 62 typedef map<string, int> msi; 63 typedef vector<int> vi; 64 typedef vector<LL> vl; 65 typedef vector<vl> vvl; 66 typedef vector<bool> vb; 67 68 int T; 69 char cmd[5]; 70 map<LL, LL> s; 71 LL n; 72 73 LL get(LL x) { 74 LL ret = 0; 75 for(int i = 62; i >= 0; i--) { 76 if(x & 1) ret |= (1LL << i); 77 x /= 10; 78 if(!x) break; 79 } 80 return ret; 81 } 82 83 int main() { 84 // FRead(); 85 while(~Rint(T)) { 86 s.clear(); 87 W(T) { 88 Rs(cmd); cin >> n; 89 n = get(n); 90 LL t = n; 91 while(t) { 92 cout << (t & 1); 93 t >>= 1; 94 } 95 cout << endl; 96 if(cmd[0] == '+') s[n]++; 97 else if(cmd[0] == '-') s[n]--; 98 else cout << s[n] << endl; 99 } 100 } 101 RT 0; 102 }