Rightmost Digit

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

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

234

Sample Output

76

Hint
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.

Author

Ignatius.L

#include<stdio.h>int main(){int n,i,j,k,l;long m;scanf("%d",&n);while(n--){scanf("%ld",&m);i=m%10;j=i*i%10;k=j*i%10;l=k*i%10;switch(m%4){case 0:printf("%d\n",l);break;case 1:printf("%d\n",i);break;case 2:printf("%d\n",j);break;case 3:printf("%d\n",k);break;}}return 0;}