1104. Don’t Ask Woman about Her Age（数论）

a*b^n(mod(b-1) =a(mod(b-1)

http://acm.timus.ru/problem.aspx?space=1&num=1104

 #include <stdio.h>
 #include <string.h>

 char str[ + ];

 int CharToInt(char c)
 {
     if(c>='' && c<='')
         return c - '';
     return c - 'A' + ;
 }
 int main()
 {
     scanf("%s",str);
     int i,n = strlen(str);
     int sum = ;
     char ch = ' ';
     for(i=; i<n; ++i)
     {
         if(str[i] > ch) ch = str[i];
         sum += CharToInt(str[i]);
     }
     if(ch <='') i = ch - '';
     else i = ch -'A' + ;
     if(i+<) i = ;
     else i++;
     for(;i<=; ++i)
         if(sum % (i-) == )
         {

             break;
         }
     if(i<=)
         printf("%d\n",i);
     else
         puts("No solution.");
 }