HDU1060 Leftmost Digit 【数学】
来源:互联网 发布:域名分析 编辑:程序博客网 时间:2024/05/17 06:04
Leftmost Digit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12897 Accepted Submission(s): 4934
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.
因为N^N = A * 10^X (科学计数法,A即为所求最高位),两边同时取对数得N * log10(N) = log10(A) + X, 得 log10(A) = N * log10(N) - X, 得 A = 10^(N*log10(N) - X), 其中X为N^N结果的位数-1,即[log10(N*N)], 中括号表示取整,所以最终结果为A = 10^(N*log10(N) - [N*log10(N)]).需要注意的是N^N的位数要用__int64类型存储。
#include <stdio.h>#include <math.h>int main(){ int t, n; double ans; scanf("%d", &t); while(t--){ scanf("%d", &n); ans = n * log10(n); ans -= (__int64)ans; ans = pow(10, ans); printf("%d\n", (int)ans); } return 0;}
0 0
- HDU1060 Leftmost Digit 【数学】
- 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(数论)
- Leftmost Digit(数学)
- HDU 1060 Leftmost Digit(数学)
- 数学——Leftmost Digit
- HDU 1060:Leftmost Digit【数学】
- Android开发学习-8__图解
- VC++6.0编译时出现fatal error C1010: unexpected end of file while looking for precompiled header directiv
- 对SQL说不!NoSQL的数据库技术革命
- C语言函数调用约定-stdcall&cdecl&thiscall
- 分布式事务场景
- HDU1060 Leftmost Digit 【数学】
- WinRAR被曝感染木马极难清除
- Android中使用代码截图的各种方法总结
- 智力题集合
- notonlysuccess大神的线段树完全版
- java中堆(heap)和堆栈(stack)有什么区别
- C语言指针
- Google Android开发精华教程
- 快速开发10之归属地查询——自带数据库查询类和数据库不用联网