HDU -> ACM ->Rightmost Digit

Rightmost Digit

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 236   Accepted Submission(s) : 71

Problem Description

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

 

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.<br>Each test case contains a single positive integer N(1<=N<=1,000,000,000).<br>

 

Output

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

 

Sample Input

2

3

4

 

Sample Output

7

6

<div style='font-family:Times New Roman;font-size:14px;background-color:F4FBFF;border:#B7CBFF 1px dashed;padding:6px'><div style='font-family:Arial;font-weight:bold;color:#7CA9ED;border-bottom:#B7CBFF 1px dashed'><i>Hint</i></div>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.</div>

 

#include<stdio.h>
int my_divides(int sum)
{
    int i;
    if(sum < 10)
        return sum;

    i = sum % 10;  //个位
    return i;
}
int main()
{
    int n;
    scanf("%d", &n);
    while(n--)
    {
        int i, a;
        scanf("%d", &a);
        int sum = a;
        for(i = 0; i < a - 1; i++)
        {
            sum = my_divides(sum) * a;
        }
        printf("%d\n", sum % 10);
    }
    return 0;
}

Time Limit Exceeded

1. #include<stdio.h>  
2. #include<stdlib.h>  
3. int main()  
4. {  
5.     int n,m,i,j,a,b;  
6.     long long int sum=1;  
7.     while(~scanf("%d",&n))  
8.     {  
9.         for(i=0;i<n;i++)  
10.         {  
11.             scanf("%d",&m);  
12.             b=m%20;  
13.             if(b==0)  
14.                 b=10;  
15.             a=1;  
16.             for(j=0;j<b;j++)  
17.             {  
18.                 sum=a*b;  
19.                 a=sum%10;  
20.             }  
21.             printf("%d\n",a);  
22.         }  
23.     }  
24.     return 0;  
25. }