Rightmost Digit

Rightmost Digit

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

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

2 3 4

 

Sample Output

7 6

 

#include<stdio.h>
#include<string.h>
int a[10];
int main()
{
    int T,n,i,k,temp,b,t;
    scanf("%d",&T);
    while(T--)
    {
        memset(a,0,sizeof(a));
        scanf("%d",&n);
        t = n;
        n %= 10;
        if(n==1||n==0)
        {
            printf("%d\n",n);
            continue ;
        }
        temp = 0;
        b = n;
        i = 0;
        while(temp!=n)
        {
            a[i++] = b;
            temp = (b*n)%10;
            b = temp;
        }
        k = t%i==0?i-1:t%i-1;
        printf("%d\n",a[k]);
    }
    return 0;
}