【HDU

点击打开链接

                                                 Rightmost Digit

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 57020    Accepted Submission(s): 21551

Problem Description

Given a positive integer N, you should output the most right digit of N^N.

 

Input

The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case contains a single positive integer N(1<=N<=1,000,000,000).

 

Output

For each test case, you should output the rightmost digit of N^N.

 

Sample Input

234

 

Sample Output

76
Hint
In the first case, 3 * 3 * 3 = 27, so the rightmost digit is 7.In the second case, 4 * 4 * 4 * 4 = 256, so the rightmost digit is 6.

// 求n的n次方的最后一位数  n的范围较大 利用快速幂做题

//代码如下：

#include <stdio.h>int main(){int n,t,i,k,m;scanf("%d",&t);int fun(int a,int b);while(t--){scanf("%d",&n);k=fun(n,n);printf("%d\n",k);}return 0;}int fun(int a,int b){int ans=1;a=a%10;while(b>0){if(b%2==1) ans=(ans*a)%10;b=b/2;a=(a*a)%10;}return ans;}