hdu1061——Rightmost Digit
来源:互联网 发布:凤凰金融 网络凤凰网 编辑:程序博客网 时间:2024/06/07 04:05
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
76
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.
In the second case, 4 * 4 * 4 * 4 = 256, so the rightmost digit is 6.
代码
#include <iostream>using namespace std;int main(){ long n,m,num,p; cin>>num; while(num--){ cin>>n; m = p = n % 10; if (n % 4 == 0) n = 4; else n = n % 4; while(--n) p = (p * m) % 10; cout<<p<<endl; } return 0;}
主要还是找规律
0 0
- hdu1061——Rightmost Digit
- HDU1061——Rightmost Digit
- HDU1061:Rightmost Digit
- HDU1061 Rightmost Digit
- Rightmost Digit(HDU1061)
- hdu1061 Rightmost Digit
- HDU1061 Rightmost Digit
- HDU1061 Rightmost Digit
- hdu1061 Rightmost Digit
- Rightmost Digit(hdu1061)
- hdu1061 rightmost digit
- HDU1061 Rightmost Digit
- HDU1061-Rightmost Digit(快速幂取模)
- HDU1061:Rightmost Digit(快速幂取模)
- HDU1061-Rightmost Digit(快速幂取模)
- HDU1061 Rightmost Digit(快速幂取模)
- 【快速幂取模】HDU1061 Rightmost Digit
- Rightmost Digit(hdu1061二分取模)
- Android 关于新浪微博的OAuth2.0授权
- 【java web】--以终为始,Asp.Net
- FFmpeg资源一览
- 第一章 笔记
- visual studio dll生成与调用方法
- hdu1061——Rightmost Digit
- 遍历图像像素点的方法
- char[]数组名与指针,以及字符串数组与string的一些比较
- common-logging
- 回调函数
- ios文本框字体样式
- 【hdoj 1181】变形课
- 统计函数耗费时间,简单的图像运算,定义感兴趣区域 第二章
- ffmpeg处理RTMP流媒体的命令大全