【CodeForces 713A】
来源:互联网 发布:互联网金融发展 知乎 编辑:程序博客网 时间:2024/04/30 12:07
#include <bits/stdc++.h>#define manx 100005typedef long long ll;using namespace std;int main(){ int t; while(~scanf("%d",&t)){ getchar(); char c[30]; map<ll,ll> mp; while(t--){ ll s=0; gets(c); int l = strlen(c); for (int i=2; i<l; i++){ if (c[i]&1) s = s*10 + 1; else s *= 10; } if (c[0] == '+') mp[s]++; else if (c[0] == '-') mp[s]--; else printf("%I64d\n",mp[s]); } } return 0;}
A. Sonya and Queries
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 hert queries, each of one of the following type:
- + ai — add non-negative integerai to the multiset. Note, that she has a multiset, thus there may be many occurrences of the same integer.
- - ai — delete a single occurrence of non-negative integerai from the multiset. It's guaranteed, that there is at least oneai in the multiset.
- ? s — count the number of integers in the multiset (with repetitions) that match some patterns consisting of 0 and1. In the pattern, 0 stands for the even digits, while1 stands for the odd. Integer x matches the pattern s, if the parity of thei-th from the right digit in decimal notation matches thei-th from the right digit of the pattern. If the pattern is shorter than this integer, it's supplemented with0-s from the left. Similarly, if the integer is shorter than the pattern its decimal notation is supplemented with the0-s from the left.
For example, if the pattern is s = 010, than integers92, 2212, 50 and 414 match the pattern, while integers3, 110, 25 and 1030 do not.
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. Thei-th row starts with a character ci — the type of the corresponding operation. Ifci is equal to '+' or '-' then it's followed by a space and an integerai (0 ≤ ai < 1018) given without leading zeroes (unless it's 0). Ifci equals '?' 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.
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.
12+ 1+ 241? 1+ 361- 241? 0101+ 101? 101- 101? 101+ 4000? 0
21211
4+ 200+ 200- 200? 0
1
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.
- 【CodeForces 713A】
- CodeForces-a
- Codeforces 903A A
- codeforces 713 A. Sonya and Queries
- Codeforces-713A Sonya and Queries
- CodeForces 18A A - Triangle
- CodeForces 133A A. HQ9+
- codeforces 651A A. Joysticks
- 【Codeforces 597A】A. Divisibility
- 【 Codeforces 615A】A. Bulbs
- A. Divisibility CodeForces 597A
- codeforces 417A A. Elimination
- CodeForces 534A A. Exam
- codeforces#98 a
- codeforces#99 a
- codeforces 105 div2 A
- codeforces #121 A
- Codeforces 185A Plant
- 对上一篇jni的纠正把
- 最小生成树
- 二叉搜索树(遍历不递归,不用栈)
- QT中读写文件操作
- 设计模式02-工厂模式
- 【CodeForces 713A】
- JDBC连接mysql
- 单例模式的c++实现
- maven项目 错误: 找不到或无法加载主类
- PAT甲级 1122. Hamiltonian Cycle (25)
- 从零搭建Hadoop集群
- C++primer -2
- 第3课 03 JS中级课程-事件流-事件冒泡机制-3
- 第3课 04 JS中级课程-事件绑定的第二种形式-4