PAT练习参考答案_个位数统计 (15)

题目描述
给定一个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<iostream>
#include<cstring>
using namespace std;
int main ()
{
    string N;
    int count0 = 0,count1 = 0,count2 = 0,count3 = 0,count4 = 0,count5 = 0,
        count6 = 0,count7 = 0,count8 = 0,count9 = 0,i=0;
    cin>>N;
    for(i = 0; i < N.length();i++)
    {
        if(N[i] == '0') count0++;
        else if(N[i] == '1') count1++;
        else if(N[i] == '2') count2++;
        else if(N[i] == '3') count3++;
        else if(N[i] == '4') count4++;
        else if(N[i] == '5') count5++;
        else if(N[i] == '6') count6++;
        else if(N[i] == '7') count7++;
        else if(N[i] == '8') count8++;
        else if(N[i] == '9') count9++;
        //cin>>N;
    }

    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;
}