Today Sonya learned about long integers and invited all her friends to share the fun. Sonya has an initially empty multiset with integers. Friends give her?tqueries, each of one of the following type:

?+??a_i?— add non-negative integer?a_i?to the multiset. Note, that she has a multiset, thus there may be many occurrences of the same integer.

?-??a_i?— delete a single occurrence of non-negative integer?a_i?from the multiset. It's guaranteed, that there is at least one?a_i?in the multiset.

??s?— count the number of integers in the multiset (with repetitions) that match some pattern?s?consisting of?0?and?1. In the pattern,?0?stands for the even digits, while?1?stands for the odd. Integer?x?matches the pattern?s, if the parity of the?i-th from the right digit in decimal notation matches the?i-th from the right digit of the pattern. If the pattern is shorter than this integer, it's supplemented with?0-s from the left. Similarly, if the integer is shorter than the pattern its decimal notation is supplemented with the?0-s from the left.

For example, if the pattern is?s?=?010, than integers?92,?2212,?50?and?414?match the pattern, while integers?3,?110,?25?and?1030?do not.

Input

The first line of the input contains an integer?t?(1?≤?t?≤?100?000)?— the number of operation Sonya has to perform.

Next?t?lines provide the descriptions of the queries in order they appear in the input file. The?i-th row starts with a character?c_i?— the type of the corresponding operation. If?c_i?is equal to '+' or '-' then it's followed by a space and an integer?a_i?(0?≤?a_i?<?10¹⁸) given without leading zeroes (unless it's?0). If?c_iequals '?' then it's followed by a space and a sequence of zeroes and onse, giving the pattern of length no more than?18.

It's guaranteed that there will be at least one query of type '?'.

It's guaranteed that any time some integer is removed from the multiset, there will be at least one occurrence of this integer in it.

Output

For each query of the third type print the number of integers matching the given pattern. Each integer is counted as many times, as it appears in the multiset at this moment of time.

Example Input12 + 1 + 241 ? 1 + 361 - 241 ? 0101 + 101 ? 101 - 101 ? 101 + 4000 ? 0 Output2 1 2 1 1 Input4 + 200 + 200 - 200 ? 0 Output1 Note

Consider the integers matching the patterns from the queries of the third type. Queries are numbered in the order they appear in the input.

1?and?241.

361.

101?and?361.

361.

4000.?

#include <iostream> #include <algorithm> #include <vector> #include <set> using namespace std; int main() {int a[300005]={0};int t,ans;long long ant;char s;string str;cin>>t;while(t--){cin>>s;switch(s){case '+':cin>>str;ant=0;ans=18;for(int i=str.length()-1;i>=0||ans;i--,ans--){if(i<0)ant*=2;elseant=ant*2+(str[i]-'0')%2;}a[ant]++;break;case '-':ant=0;ans=18;cin>>str;for(int i=str.length()-1;i>=0||ans;i--,ans--){if(i<0)ant*=2;elseant=ant*2+(str[i]-'0')%2;}a[ant]--;break;case '?':ant=0;ans=18;int sum=0;cin>>str;for(int i=str.length()-1;i>=0||ans;i--,ans--){if(i<0)ant*=2;elseant=ant*2+str[i]-'0';}sum=a[ant];cout<<sum<<endl;break;}}return 0; }#include <iostream> #include <algorithm> #include <vector> #include <set> using namespace std; int main() {//int a[1000000000];//10萬萬 的時候會炸int a[300005]={0};int t;long long ant;char s;long long str;int ans;cin>>t;while(t--){cin>>s;switch(s){case '+':cin>>str;ant=0;ans=18;while(ans--){ant=ant*2+(str%2);str/=10;}a[ant]++;break;case '-':ant=0;cin>>str;ans=18;while(ans--){ant=ant*2+(str%2);str/=10;}a[ant]--;break;case '?':ant=0;int sum=0;cin>>str;ans=18;while(ans--){ant=ant*2+(str%2);str/=10;}sum=a[ant];cout<<sum<<endl;break;}}return 0; }#include <iostream> using namespace std; #include <algorithm> #include <map> #include <cstring> int main() {map<long long ,int>m;int t; long long a,b,i;//類型是long long 要不會gg的char c;long long str,x;cin>>t;while(t--){cin>>c;switch(c){case '+':a=0,b=0;cin>>str;i=1;do{b=str%2;a+=b*i;i*=10;x=str;str/=10;}while(str!=0);a+=i*x%2;m[a]++;break;case '-':a=0,b=0;cin>>str;i=1;do{b=str%2;a+=b*i;i*=10;x=str;str/=10;}while(str!=0);a+=i*x%2;m[a]--;break;case '?':cin>>str;cout<<m[str]<<endl;break;}}return 0; }
#include <iostream> using namespace std; #include <algorithm> #include <map> #include <cstring> int main() {map<long long ,int>m;long long t,a,b;char c;long long str;cin>>t;while(t--){cin>>c;switch(c){case '+':a=0,b=0;cin>>str;for(int i=1;str!=0;i*=10){b=str%2;a+=b*i;str/=10;}//這個是錯誤代碼，沒有考慮到str最后等于0的時候的相乘，m[a]++;break;case '-':a=0,b=0;cin>>str;for(int i=1;str!=0;i*=10){b=str%2;a+=b*i;str/=10;}m[a]--;break;case '?':cin>>str;cout<<m[str]<<endl;break;}}return 0; }

總結(jié)

以上是生活随笔為你收集整理的Sonya and Queries CodeForces - 714C的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。