B1021 single digit statistics

1021 Single digit statistics (15 branch )

Given a k An integer N, Satisfy the following formula ：
Please write a program to count the number of times each different digit number appears . for example ： Given N=100311, Then there are 2 individual 0,3 individual 1, and 1 individual 3.

Input format ：
Each input contains 1 Test cases , I.e. no more than one 1000 Bit positive integer N.

Output format ：
Yes N Each different digit in , With D:M Output the digit in one line D And in N Is the number of times M. Required press D Ascending output of .

sample input

100311

sample output

0:2
1:3
3:1

Topic analysis ：

1. Use string To read numeric characters
2. Count array flag

The code is as follows ：

#include<bits/stdc++.h>
using namespace std;
int main(){
    string s;
    int flag[10]={0};
    getline(cin,s);
    for(int i=0;i<s.size();i++){
        int number=s[i]-'0';
        flag[number]++;
    }
    for(int i=0;i<=9;i++){
        if(flag[i]){
            cout<<i<<":"<<flag[i]<<endl;
        }
    }
    
    return 0;
}