HDU 1060 Leftmost Digit
来源:互联网 发布:淘宝活动招商入口 编辑:程序博客网 时间:2024/04/24 01:18
Leftmost Digit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12985 Accepted Submission(s): 4973
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.
要了解 log的用法、pow函数的用法
#include<stdio.h>#include<math.h>int main(){int T,a;double m;scanf("%d",&T);while(T--){__int64 N;double a;scanf("%I64d",&N);m=N*log10((double)N)-(__int64)(N*log10((double)N));a=pow(10.0,m);printf("%d\n",(int)a);}return 0;
0 0
- HDU 1060 Leftmost Digit & BIT1046 Leftmost Digit
- hdu 1060 Leftmost Digit
- hdu 1060 Leftmost Digit
- HDU 1060 Leftmost Digit
- hdu 1060 Leftmost Digit
- hdu 1060 Leftmost Digit
- HDU 1060 LeftMost Digit
- HDU 1060 Leftmost Digit
- HDU 1060 Leftmost Digit
- hdu 1060 Leftmost Digit
- hdu 1060 Leftmost Digit
- hdu - 1060 - Leftmost Digit
- hdu 1060 Leftmost Digit
- HDU 1060 Leftmost Digit
- hdu 1060 Leftmost Digit
- HDU 1060 Leftmost Digit
- HDU-1060 Leftmost Digit
- hdu 1060 Leftmost Digit
- 面试中经常问的三种简单排序方法
- 集合(Arrays)-数组变集合
- Oracle BPM开发中遇到的一些问题和解决方法
- 【HDU1978】How many ways DP行走方式
- 【TOJ 1661】Solitaire【BFS】
- HDU 1060 Leftmost Digit
- linux nc指令(抄录)
- vim的配置
- 九度题目1188:约瑟夫环
- 杭电1242————搜索之优先队列
- flash player在centos 6.5上的安装步骤(yum方法)
- css实现星级商户评分
- 关于编写web代码时提示语
- 黑马程序员——练习题随笔