Rightmost Digit
来源:互联网 发布:linux更改用户 编辑:程序博客网 时间:2024/06/07 20:33
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).
Output
For each test case, you should output the rightmost digit of N^N.
Sample Input
2
3
4
Sample Output
7
6
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.
题目的大意是:
比如输入应该4,就4*4*4*4=256,如果是3,就3*3*3=27,
这里只取最后一位,256就取6,27就是取7.
说一下解题思路:
这道题目刚刚拿到手,我二话不说直接用了粗暴的方式for循环,麻蛋的,这里的N取值(1<=N<=1,000,000,000).很明显就是不行的,必须找规律,看懂下面的那个数组是怎么出来的就行了。
#include<stdio.h>#include<string.h>//4,8,6,2 9,7,1,3 6,4,6,4 9,3,1,7 4,2,6,8 1,9,1,9int a[10][4]={{0,0,0,0},{1,1,1,1},{6,2,4,8},{1,3,9,7},{6,4,6,4},{5,5,5,5},{6,6,6,6},{1,7,9,3},{6,8,4,2},{1,9,1,9}};int main(){ int T,N; scanf("%d",&T); while(T--){ scanf("%d",&N); printf("%d\n",a[N%10][N%4]); } return 0;}
- Rightmost Digit
- Rightmost Digit
- Rightmost Digit
- Rightmost Digit
- Rightmost digit
- Rightmost Digit
- Rightmost Digit
- Rightmost Digit
- Rightmost Digit
- Rightmost Digit
- Rightmost Digit
- Rightmost Digit
- Rightmost Digit
- Rightmost Digit
- Rightmost Digit
- Rightmost Digit
- Rightmost Digit
- Rightmost Digit
- 有趣的Autolayout示例-Masonry实现
- 带附件的java.mail邮件发送
- 深圳初中生约架群殴 家长协调未果加入打斗
- ME21N,ME22N,ME23N之BADI增强ME_PROCESS_PO_CUST
- Linux入门教程
- Rightmost Digit
- sdwebimage
- CSU1630: Plane Ticket Pricing
- 设置修改CentOS系统时区
- MFC radio控件的使用方法
- 【Android】FragmentTabHost实现底部Tab菜单选项
- 透过浏览器看HTTP缓存
- 成都保安阻止小伙偷车 3人拿刀冲进银行追砍(图)
- 1002—列变位法解密