HDU 1060 Leftmost Digit【log10/求N^N的最高位数字是多少】
2024-08-30 02:34:17
Leftmost Digit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 19010 Accepted Submission(s): 7507
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).
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 leftmost digit of N^N.
Sample Input
2
3
4
3
4
Sample Output
2
2
2
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.
Author
Ignatius.L
【分析】:
【代码】:
#include <bits/stdc++.h>
using namespace std; typedef long long LL;
const int MOD = ;
typedef vector<LL> vec;
typedef vector<vec> mat; int main()
{
int n,t,ans;
double tmp;
cin>>t;
while(t--){
cin>>n;
tmp=n*log10(1.0*n);
tmp=tmp-(__int64)tmp;
ans=(int)(pow(10.0,tmp));
printf("%d\n",ans);
}
return ;
}
数论
最新文章
- [Erlang 0126] 我们读过的Erlang论文
- tomcat出现的PermGen Space问题
- 【算法】简单动态规划——三逆数的O(N^2)解法!
- PPAS上运行pg_dump经过II
- Cycling
- ZOJ-2965
- BZOJ.4160.[NEERC2009]Exclusive Access 2(状压DP Dilworth定理)
- richedit缩放
- SSH 协议的 ssh StrictHostKeyChecking
- VS Code折腾记 - (2) 快捷键大全,没有更全
- 安装IIS
- save
- python---django中url访问方法
- 品鉴同事发来的炸金花的PHP程序代码
- 2018.06.30 BZOJ3083: 遥远的国度(换根树剖)
- Linux内存管理(text、rodata、data、bss、stack&;heap)
- (转) 打开声音设备需要使用waveOutOpen函数
- lambda distinct
- Jsp遍历后台传过来的List
- gentoo emerge unable to sync