关闭

Leftmost Digit

标签: integeroutputmath.hinputeachc
362人阅读 评论(0) 收藏 举报
分类:

点击打开链接

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).
 

Output
For each test case, you should output the leftmost digit of N^N.
 

Sample Input
2 3 4
 

Sample Output
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.

将整数与小数分开的函数,modf(),头文件《math.h》



#include<math.h>
#include<stdio.h>
int main()
{
	double a,b,c;
	int i,j,k,ncase,m,n;
	scanf("%d",&ncase);
	while(ncase--)
	{
		scanf("%d",&m);
		a=m*log10(m);
		b=modf(a,&c);
		k=(int)pow(10,b);
		printf("%d\n",k);
	}
	
	return 0;
}


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:147458次
    • 积分:1543
    • 等级:
    • 排名:千里之外
    • 原创:92篇
    • 转载:8篇
    • 译文:2篇
    • 评论:1条
    最新评论