hdoj.1061 Rightmost Digit 20140731

来源:互联网 发布:telnet本机端口不通 编辑:程序博客网 时间:2024/06/06 05:06

Rightmost Digit

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


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.
 
 
 
 
 
#include<stdio.h>int main(){    int n,a,i,sum;    scanf("%d",&n);    while(n--){        scanf("%d",&a);        sum=a%20;        for(i=1;i<a%20;i++){            sum=(sum*(a%100))%10;        }        printf("%d\n",sum);    }    return 0;}

 
 
 
 
 
 
 
0 0
原创粉丝点击