392人阅读 评论(0)

# Rightmost Digit

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

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


1.快速幂取余

#include<stdio.h>
int PowerMod(int a,int b,int c)// a的b 次方 取余数为c
{
int ans=1;
a=a%c;
while(b>0)
{
if(b%2==1)
ans=(ans*a)%c;
b=b/2;
a=(a*a)%c;
}
return ans;
}
int main (void)
{
int n,a;
scanf("%d",&n);
while(n--)
{
scanf("%d",&a);
printf("%d\n",PowerMod(a,a,10));
}
return 0;
}


0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：734063次
• 积分：5494
• 等级：
• 排名：第5655名
• 原创：213篇
• 转载：25篇
• 译文：0篇
• 评论：97条
博客专栏
 数据结构 文章：12篇 阅读：4359
 ACM解题报告 文章：39篇 阅读：47668
 Java_学习笔记 文章：41篇 阅读：130337
最新评论