L1-003. 个位数统计

//ac

#include <iostream>#include <cstdlib>#include <stdio.h>#include <algorithm>#include <math.h>#include <string.h>#include <queue>#include <stack>#include <vector>#include <map>#include <set>typedef long long ll;using namespace std;int main(){    string s;    int b[11]={0};    cin>>s;    for (int i =0; i<s.size(); i++) {        for (int j=0; j<=10; j++) {            if(s[i]-'0'==j){                b[j]++;            }        }    }    for (int i=0; i<=9; i++) {        if(b[i]){            printf("%d:%d\n",i,b[i]);        }    }       return 0;}