算法入门 习题3-3 数数字

#include <stdio.h>
#include<iostream>
#include <string.h>
using namespace std;
#define maxn 10005
char s[maxn];

int main(){
	cin>>s;
	int len=strlen(s);
	int a=0,b=0,c=0,d=0,e=0,f=0,g=0,h=0,x=0,y=0;
	for(int i=0;i<len;i++){
		switch(s[i]){
			case '0':a++;break;
			case '1':b++;break;
			case '2':c++;break;
			case '3':d++;break;
			case '4':e++;break;
			case '5':f++;break;
			case '6':g++;break;
			case '7':h++;break;
			case '8':x++;break;
			case '9':y++;break;
		}
	}
	printf("0=%d 1=%d 2=%d 3=%d 4=%d 5=%d 6=%d 7=%d 8=%d 9=%d",a,b,c,d,e,f,g,h,x,y);
	return 0; 
}