Leftmost Digit
来源:互联网 发布:防破解网络验证 编辑:程序博客网 时间:2024/06/06 05:35
Problem Description
Given a positive integer N, you should output the leftmost 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 leftmost digit of N^N.
Sample Input
234
Sample Output
22
Hint
In the first case, 3 * 3 * 3 = 27, so the leftmost digit is 2.
In the second case, 4 * 4 * 4 * 4 = 256, so the leftmost digit is 2.
In the second case, 4 * 4 * 4 * 4 = 256, so the leftmost digit is 2.
题目大意:算出N^N最左边的数字是多少,直接算肯定溢出,
m=n^n;两边同取对数,得到,log10(m)=n*log10(n);再得到,m=10^(n*log10(n));
然后,对于10的整数次幂,第一位是1,所以,第一位数取决于n*log10(n)的小数部分(涉及了对数运算,因为整数部分的为10^m,对最左边位置数无影响)
#include <iostream>#include<cstdio>#include<cmath>using namespace std;int main(){ int icase; scanf("%d",&icase); while(icase--) { int n; scanf("%d",&n); double r1=n*log10(n); double r2=r1-(long long)r1; printf("%d\n",(int)pow(10,r2)); }}
0 0
- Leftmost Digit
- Leftmost Digit
- Leftmost Digit
- Leftmost Digit
- Leftmost Digit
- Leftmost Digit
- Leftmost Digit
- Leftmost Digit
- Leftmost Digit
- Leftmost Digit
- Leftmost Digit
- Leftmost Digit
- Leftmost Digit
- Leftmost Digit
- Leftmost Digit
- Leftmost Digit
- Leftmost Digit
- Leftmost Digit
- C语言的强制类型转化总结
- Linux与Windows文件系统的差异比较
- [USACO]完美的牛栏
- a
- 蓝桥杯vip练习 Huffman树
- Leftmost Digit
- SharePoint 2013 ECB 自定义扩展菜单
- ACM 兄弟郊游问题
- Intellij IDEA问题:Error during artifact deployment. See server log for details
- Python正则表达式学习(5)——re.findall()
- C#学习之关于lock
- 【LeetCode】Validate Binary Search Tree 解题报告
- 告诉学生:这才是中、高考阅卷真正的“潜规则”!
- Eclipse建立Maven maven-archtype-webapp项目