hdoj.1061 Rightmost Digit 20140731
来源:互联网 发布:telnet本机端口不通 编辑:程序博客网 时间:2024/06/06 05:06
Rightmost Digit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 31606 Accepted Submission(s): 12094
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(){ int n,a,i,sum; scanf("%d",&n); while(n--){ scanf("%d",&a); sum=a%20; for(i=1;i<a%20;i++){ sum=(sum*(a%100))%10; } printf("%d\n",sum); } return 0;}
0 0
- hdoj.1061 Rightmost Digit 20140731
- HDOJ 1061: Rightmost Digit
- hdoj 1061Rightmost Digit
- HDOJ 1061 Rightmost Digit
- HDOJ 1061 Rightmost Digit
- hdoj 1061 Rightmost Digit
- HDOJ 1061 - Rightmost Digit
- HDOJ--1061--Rightmost Digit
- HDOJ 1061Rightmost Digit
- HDOJ 1061 Rightmost Digit
- hdoj 1061 Rightmost Digit
- Rightmost Digit hdoj 1061
- HDOJ--1061--Rightmost Digit
- HDOJ 1061 Rightmost Digit
- hdoj-1061-Rightmost Digit
- HDOJ-1061 Rightmost Digit
- hdoj 1061 Rightmost Digit
- HDOJ-1061 Rightmost Digit
- 目前已经实现授权
- 淘宝API学习之道:简单介绍淘宝API功能接口作用
- spring3 定时器 时间配置
- Android4.0(Phone)拨号启动过程分析(三)与Framework层通信
- 如何防止多次提交同一个表单?
- hdoj.1061 Rightmost Digit 20140731
- 开源词典
- Valid Palindrome(LeetCode)
- Qt4.8.5配置相关问题
- 内核同步之名词解释和原子操作
- 【Node.js】专门针对初学者的Node.js教程
- SAE storage linux管理
- linux c dynamic library programming
- 7/31