hdu 1061 hdoj 1061

Rightmost Digit

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

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
  
  

#include<stdio.h>

main()
{
    int n,k,i,result;
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d",&k);
        result=1;
        if(k%4==0)
        {
            for(i=0;i<4;i++)
            {
                result=(result*(k%10))%10;
            }
        }
        for(i=0;i<k%4;i++)
        {
            result=(result*(k%10))%10;
        }
        printf("%d\n",result);
    }
}