Finally, it's over... It's not easy ....
I used the previously summarized knowledge and finally converted itCode....
# Include <stdio. h> <br/> # define ll unsigned long int </P> <p> // a * B mod C <br/> inline ll mulandmod (LL, ll B, ll c) <br/>{< br/> ll Val, pre, shl_ B; <br/> pre = A % C; <br/> shl_ B = B; <br/> val = 0; <br/> while (shl_ B) <br/> {<br/> If (shl_ B & 0x1) <br/> val = (Val + pre) % C; <br/> shl_ B >>= 1; <br/> pre = (pre <1) % C; <br/>}< br/> return val; <br/>}</P> <p> inline ll a_bmodc (ll a, LL B, ll C) <br/> {</P> <p> ll Val, pre, S Hl_ B; <br/> shl_ B = B; <br/> If (shl_ B & 0x1) <br/> val = A % C; <br/> else <br/> val = 1; <br/> shl_ B >>= 1; <br/> pre = mulandmod (a, a, c ); <br/> while (shl_ B) <br/> {<br/> If (shl_ B & 0x1) <br/> val = mulandmod (Val, pre, C ); <br/> shl_ B >>= 1; <br/> pre = mulandmod (PRE, pre, c); <br/>}< br/> return val; <br/>}</P> <p> int main () <br/> {<br/> ll A, B, C; <br/> while (scanf ("% LlU", & A, & B, & C )! = EOF) <br/> printf ("% LlU/N", a_bmodc (A, B, C); <br/> return 0; <br/>}