8-1. 求一批整数中出现最多的个位数字(20)

#include <stdio.h>
int bidaxiao(int n);

int main()
{
	int a,b ;
	scanf("%d",&a);
	int x[a];
	
	int i,j,k,p;
	for(i=0; i<a; ++i){
		scanf("%d",&x[i]);		
	}
	
//	printf("%d %d %d",x[0],x[1],x[2]);
	int temp_a ;
	int c[10] ={0,0,0,0,0,0,0,0,0,0,};
	
	
	for(j=0; j<a; ++j){
		temp_a = x[j];

		while(temp_a > 0){
			b = temp_a%10 ;
			temp_a /= 10 ;
			switch(b){
				case 0:
					c[0] += 1;
					break;
				case 1:
					c[1] += 1 ;
					break;
				case 2:
					c[2] += 1 ;
					break;
				case 3:
					c[3] += 1 ;
					break;
				case 4:
					c[4] += 1 ;
					break;
				case 5:
					c[5] += 1 ;
					break;
				case 6:
					c[6] += 1 ;
					break;
				case 7:
					c[7] += 1 ;
					break;
				case 8:
					c[8] += 1 ;
					break;
				case 9:
					c[9] += 1 ;
					break;
			}
		}	
	}
	
	int max = c[9];
	int index = 9 ;
	
	for(k=8; k>=0; --k){
		if(max < c[k]){
			max = c[k] ;
			index = k ;
		}
	}
	printf("%d: ",max);
	
	for(p = 0; p < index; ++p) {
		if(max == c[p])
			printf("%d ", p);
	}
	printf("%d\n", index);
//	printf("%d",c[1]);
	return 0;
}