C++-字符串-车牌统计(拓展01-计算含2位数字的次数)
You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.
Background
Description
车牌统计。 小匠喜欢研究数字,他收集了N块车牌,想研究数字0 ~9中某两个数字相邻出现使用在车牌上的次数,如果一个车牌是99999,那么99就出现4次。比如:68出现在100块车牌上、51出现在0块车牌上。
Format
Input
Output
Samples
10
47306
57403
13606
60186
900HA
B5807
11451
14514
99999
90603
00:1
01:1
03:2
06:3
07:1
11:1
13:1
14:3
18:1
30:1
36:1
40:1
45:2
47:1
51:2
57:1
58:1
60:3
73:1
74:1
80:1
86:1
90:2
99:4
Limitation
1s, 1024KiB for each test case.
字符串
- Status
- Done
- Rule
- ACM/ICPC
- Problem
- 9
- Start at
- 2024-4-30 0:00
- End at
- 2024-5-12 12:00
- Duration
- 300 hour(s)
- Host
- Partic.
- 6