Rightmost Digit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 53376 Accepted Submission(s): 20244
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).
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 6HintIn 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 qiuyu(int n) { int a,b; a=b=n; int yushu = 1; a = a % 10; while(b>0) { if(b % 2==1) yushu= (yushu * a) % 10; b = b/2; a = (a * a) % 10; } return yushu; } int main() { int t,a,yushu; scanf("%d",&t); while(t--) { int n; scanf("%d",&n); yushu=qiuyu(n); printf("%d\n",yushu); }
}