//Q64. Find the digit that occurs the most times in an integer number.
#include <stdio.h>
int main() {
    int n, d, f[10]={0}, i, max=0, ans=0;
    while(n){
        d=n%10;
        f[d]++;
        n/=10;
    }
    for(i=0;i<10;i++)
        if(f[i]>max){ max=f[i]; ans=i; }
}
 
				Ly9RNjQuIEZpbmQgdGhlIGRpZ2l0IHRoYXQgb2NjdXJzIHRoZSBtb3N0IHRpbWVzIGluIGFuIGludGVnZXIgbnVtYmVyLgojaW5jbHVkZSA8c3RkaW8uaD4KaW50IG1haW4oKSB7CiAgICBpbnQgbiwgZCwgZlsxMF09ezB9LCBpLCBtYXg9MCwgYW5zPTA7CiAgICBzY2FuZigiJWQiLCZuKTsKICAgIHdoaWxlKG4pewogICAgICAgIGQ9biUxMDsKICAgICAgICBmW2RdKys7CiAgICAgICAgbi89MTA7CiAgICB9CiAgICBmb3IoaT0wO2k8MTA7aSsrKQogICAgICAgIGlmKGZbaV0+bWF4KXsgbWF4PWZbaV07IGFucz1pOyB9CiAgICBwcmludGYoIiVkIiwgYW5zKTsKfQo=