快速幂取模的题目:
Problem Description
Given a positive integer N, you should output the most right digit
of N^N.
给定一个正整数N,应该输出N^N的最右数字。(说白了就是输出得数%10的结果)
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).
输入包含几个测试用例。输入的第一行是一个整数T,它是测试用例的数量。接下来是T个测试用例。每个测试用例都包含一个正整数N(1<=N<=100000000)。
Output
For each test case, you should output the rightmost digit of N^N.
对于每个测试用例,您应该输出N^N的最右边的数字。
Sample Input
2
3
4
Sample Output
7
6
[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.
[/hint]
我是真没想到这题还能偷鸡(参考了某位大佬):
#include<stdio.h>
int main()
{
int T,n;
int a