当前位置：网站首页>PAT Level B - B1021 Single Digit Statistics (15)

PAT Level B - B1021 Single Digit Statistics (15)

2022-08-05 09:13:00 【nekoha_dexter】

Given a k-bit integer N=dk−1​10k−1+⋯+d1​101+d0​ (0≤di​≤9, i=0,⋯,k−1, dk−1​>0), please write a program to count the number of occurrences of each different single digit.Example: Given N=100311, there are 2 0s, 3 1s, and 1 3.

input format:

Each input contains 1 test case, a positive integer N of no more than 1000 digits.

Output format:

For each different one-digit digit in N, output the digit D and its occurrence in N on one line in the format D:MTimes M.Requires output in ascending order of D.

Input sample:

100311

Example output:

0:21:33:1
#include#includeusing namespace std;int main(){string s;cin >> s;//record the number of bitsmap mp;for(int i = 0; i < s.size(); ++i)mp[s[i]]++;// outputfor(auto it = mp.begin(); it != mp.end(); ++it)cout << it->first << ":"<second<

原网站

版权声明
本文为[nekoha_dexter]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/217/202208050905333508.html

边栏推荐

猜你喜欢

随机推荐