Rightmost Digit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 39606 Accepted Submission(s): 14952
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).
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
2 3 4
Sample Output
7 6HintIn 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.
//周期为4,
#include<stdio.h>
#include<math.h>
int main()
{
int n,m,t;
scanf("%d",&t);
while (t--)
{
scanf ("%d",&n);
m=n%4;
if (m==0)
m=4;
n=n%10;
int sum=pow(n,m);
sum=sum%10;
printf ("%d\n",sum);
}
return 0;
}
//不用考虑0