Leftmost Digit hdu1060
来源:互联网 发布:适合冬天的沐浴露 知乎 编辑:程序博客网 时间:2024/05/17 02:32
N^N = a * 10^x
两边同时取对数
NlgN = lg(a*10^x)
NlgN = lga + x // NlgN 必定是小数, a 是大于0小于10 ,所以 lga 是大于0 小于1 的小数,x 必定是 NlgN 的整数部分,可以利用 x = floor(NlgN) 来算
lga = NlgN - x
a = 10^(NlgN - floor(NlgN))
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
22HintIn 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.
0 0
- hdu1060 Leftmost Digit(转载)
- hdu1060-Leftmost Digit
- HDU1060--Leftmost Digit
- HDU1060 Leftmost Digit 【数学】
- Leftmost Digit hdu1060
- HDU1060 Leftmost Digit
- hdu1060 Leftmost Digit
- hdu1060 Leftmost Digit
- HDU1060 Leftmost Digit
- HDU1060 Leftmost Digit
- hdu1060 Leftmost Digit
- HDU1060 Leftmost Digit
- HDU1060 Leftmost Digit (数学推导)
- HDU1060:Leftmost Digit(数论)
- Leftmost Digit
- Leftmost Digit
- Leftmost Digit
- Leftmost Digit
- linux下automake用法
- redis 性能测试方法
- gcc 的visibility 使用
- map用法
- 研发第二轮考核的8天--7.20~7.28
- Leftmost Digit hdu1060
- [编程之美] PSet2.3 寻找发帖“水王”
- hibernate一级缓存和二级缓存的区别与联系
- HDU_2041 超级楼梯
- linux c ---关于EOF
- sql数据库中统计表的个数
- Unity3D编辑器插件编写
- LeetCode: Palindrome Partitioning II
- BestCoder #2 1001 TIANKENG’s restaurant && Nyoj 168 房间安排