hdu 1061 快速幂取模
来源:互联网 发布:淘宝发布助手一直提示 编辑:程序博客网 时间:2024/06/05 03:28
Rightmost Digit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 43858 Accepted Submission(s): 16494
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.
Author
Ignatius.L
import java.util.Scanner;public class Main{public static void main(String[] args) {// TODO Auto-generated method stubint n;int ans;int t;Scanner cin = new Scanner(System.in);t=cin.nextInt();while(t--!=0){ans=1;n=cin.nextInt();int b=n;while(b!=0){n=n%10;if(b%2==1)ans=ans*n%10;b=b/2;n=n*n%10;}System.out.println(ans);}}}
0 0
- HDU 1061(快速幂取模)
- hdu 1061 快速幂取模!!!!!
- hdu 1061 快速幂取模
- HDU 1061 快速幂取模
- 【快速幂取模】HDU 1061---Rightmost Digit
- HDU - 1061 - Rightmost Digit (快速幂取模!)
- HDU 1061 Rightmost Digit【快速幂取模】
- hdu 1061 Rightmost Digit 快速幂取模
- HDU 1061 Rightmost Digit(快速幂取模)
- hdu 3003 快速幂取模
- hdu 1905 快速幂取模
- HDU 2035 快速幂取模
- HDU 1097 快速幂取模
- 快速幂 hdu 1061
- HDU 1061 快速幂
- hdu-1097快速幂取模运算
- hdu 1601(快速幂取模)
- HDU 1061 快速幂算法
- 在自定义drawRect setBackground不起作用的原因
- 阅读整理《从0到1》
- linux下JDK的安装详解及第一个java应用程序
- [Spring实战系列](15)使用Spring基于Java的配置
- System.out.println原理
- hdu 1061 快速幂取模
- Android开发笔记(六十一)文件下载管理DownloadManager
- 使用纯C++实现SQL Server2005 数据库读写操作详细步骤
- CodeForces 349A Cinema Line
- 扩充VirtualBox虚拟机的分辨率
- 需要决断
- 292. Nim Game
- hdu1161 (java中处理字符大小写转换)
- 017 QtCreator生成美观的可执行文件