C - Leftmost Digit 找最右边的数字

最新推荐文章于 2023-02-25 23:03:36 发布

「已注销」

最新推荐文章于 2023-02-25 23:03:36 发布

阅读量330

点赞数

分类专栏：简单数学

简单数学专栏收录该内容

18 篇文章 0 订阅

订阅专栏

C - Leftmost Digit

Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u

Submit Status Practice HDU 1060

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

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.

这个题可用的地方是用log来计算位数。要注意用的是longlong，注意pow是在math函数下的计算，也要注意这是double型。

    
    
     
     
      
      #include<stdio.h>
#include<math.h>
int main()
{
	int n;
	scanf("%d",&n);
	while(n--)
	{
		long long a;
		scanf("%lld",&a);
		double x=a*log10(a*1.0);
		double sum=x-(long long)x;
		int c=pow(10.0,sum);
		printf("%d\n",c);
	}
}