题目描述:
给定一个 k 位整数 N=dk−110k−1+⋯+d1101+d0 (0≤di≤9, i=0,⋯,k−1, dk−1>0),请编写程序统计每种不同的个位数字出现的次数。例如:给定 N=100311,则有 2 个 0,3 个 1,和 1 个 3。
输入格式:
每个输入包含 1 个测试用例,即一个不超过 1000 位的正整数 N。
输出格式:
对 N 中每一种不同的个位数字,以 D:M 的格式在一行中输出该位数字 D 及其在 N 中出现的次数 M。要求按 D 的升序输出。
输入样例:
100311
输出样例:
0:2
1:3
3:1
#include <bits/stdc++.h>
using namespace std;
int main()
{
char arr[1000+5];
int brr[1000+5];
int count0 = 0, count1 =0, count2 = 0, count3 =0, count4 = 0, count5 =0, count6 = 0, count7 =0, count8 = 0, count9 =0;
cin>>arr;
int len = strlen(arr);
for(int i=0; i<len; i++)
{
brr[i] = arr[i] - '0';
if(brr[i] == 0) count0++;
if(brr[i] == 1) count1++;
if(brr[i] == 2) count2++;
if(brr[i] == 3) count3++;
if(brr[i] == 4) count4++;
if(brr[i] == 5) count5++;
if(brr[i] == 6) count6++;
if(brr[i] == 7) count7++;
if(brr[i] == 8) count8++;
if(brr[i] == 9) count9++;
}
if(count0 != 0) cout<<'0'<<":"<<count0<<endl;
if(count1 != 0) cout<<'1'<<":"<<count1<<endl;
if(count2 != 0) cout<<'2'<<":"<<count2<<endl;
if(count3 != 0) cout<<'3'<<":"<<count3<<endl;
if(count4 != 0) cout<<'4'<<":"<<count4<<endl;
if(count5 != 0) cout<<'5'<<":"<<count5<<endl;
if(count6 != 0) cout<<'6'<<":"<<count6<<endl;
if(count7 != 0) cout<<'7'<<":"<<count7<<endl;
if(count8 != 0) cout<<'8'<<":"<<count8<<endl;
if(count9 != 0) cout<<'9'<<":"<<count9<<endl;
return 0;
}