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 6
#include<stdio.h>
int powermod(int a,int b)
{
int ans=1;
a=a%10;
while(b)
{
if(b%2)
ans=ans*a%10;
b/=2;
a=a*a%10;
}
return ans;
}
int main()
{
int n,t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
printf("%d\n",powermod(n,n));
}
return 0;
}