聪明绝顶的你与即将秃头的我

Fermat's theorem states that for any prime number p and for any integer a > 1, ap =a (mod p). That is, if we raise a to the pth power and divide by p, the remainder isa. Some (but not very many) no...

Given a positive integer N, you should output the most right digit of N^N. InputThe input contains several test cases. The first line of the input is a single integer T which is the number of test cas...

Problem Description求A^B的最后三位数表示的整数。说明：A^B的含义是“A的B次方” Input输入数据包含多个测试实例，每个实例占一行，由两个正整数A和B组成（1<=A,B<=10000），如果A=0, B=0，则表示输入数据的结束，不做处理。 Output对于每个测试实例，请输出A^B的最后三位表示的整数，每个输出占一行。 Sample Input2 3 12 ...