hdu1061
来源:互联网 发布:刚开的淘宝卖什么 编辑:程序博客网 时间:2024/05/21 17:02
Rightmost Digit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12548 Accepted Submission(s): 4861
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
234
Sample Output
76HintIn 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()
{
__int64 n;
int a[10][4]={{0},{1},{6,2,4,8},{1,3,9,7},{6,4},{5},{6},{1,7,9,3},{6,8,4,2},{1,9}},d,t;//找规律
scanf("%d",&t);
while(t--)
{
scanf("%I64d",&n);
d=n%10;
if(d==0||d==1||d==5||d==6)
printf("%d\n",d);
else if(d==4||d==9)
printf("%d\n",a[d][n%2]);
else
printf("%d\n",a[d][n%4]);
}
return 0;
}
- HDU1061
- hdu1061
- hdu1061
- hdu1061
- HDU1061
- hdu1061
- hdu1061
- HDU1061
- HDU1061
- HDU1061:Rightmost Digit
- HDU1061 Rightmost Digit
- Rightmost Digit(HDU1061)
- hdu1061 Rightmost Digit
- hdu1061(数论:快速幂取模)
- HDU1061 Rightmost Digit
- HDU1061 Rightmost Digit
- hdu1061 Rightmost Digit
- hdu1061(快速幂取余)
- WEB前台架构部分经验总结------第一章、浅谈页面设计
- hgnkj;pko';'o;'ip'po
- poj1523(割点)
- poj 3630 Phone List
- 如何在自己网站加上视频直播功能(搭建视频直播网站)
- hdu1061
- WEB前台架构教程(原创)第二章(第一节PS切图规划)
- Calculate distance based on GPS data (latitude and longitude)
- 近来在听数电与模电的课
- 很简单的过滤特殊字符的函数
- Dispatcher initialization failed
- MMORPG游戏服务器 - 技能系统设计【上篇】
- C#写的一个ping程序
- BCB远程调试