HDOJ1061Rightmost Digit
来源:互联网 发布:淘宝直通车类目出价 编辑:程序博客网 时间:2024/05/01 23:59
Rightmost Digit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 39606 Accepted Submission(s): 14952
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.
//周期为4, #include<stdio.h>#include<math.h>int main(){int n,m,t;scanf("%d",&t);while (t--){scanf ("%d",&n);m=n%4;if (m==0)m=4;n=n%10;int sum=pow(n,m);sum=sum%10;printf ("%d\n",sum);}return 0;}//不用考虑0
0 0
- HDOJ1061Rightmost Digit
- hdoj1061Rightmost Digit
- Rightmost Digit & Leftmost Digit
- Rightmost Digit
- Rightmost Digit
- Rightmost Digit
- Leftmost Digit
- Rightmost Digit
- Rome Digit
- Rightmost digit
- Leftmost Digit
- Rightmost Digit
- Leftmost Digit
- Rightmost Digit
- BIT1046Leftmost Digit
- Rightmost Digit
- Leftmost Digit
- Rightmost Digit
- Sql serer 3个排序的函数
- SAP蓝图架构设计
- PHP显示时间代码
- hive优化二
- 2. 算法基础总题
- HDOJ1061Rightmost Digit
- java集群优化——Nginx+tomcat集群配置-实践篇
- Objective-C特性:Runtime
- Apache的下载安装(主要说的 64位)及问题
- thinkphp连接数据库
- android解决部分手机无法通过uri获取到相册的path
- hibernate3下载地址
- Android官方技术文档翻译——ApplicationId 与 PackageName
- cookie类的简单创建