国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁 > 學院 > 開發設計 > 正文

hdu--1060--Leftmost Digit

2019-11-11 04:25:54
字體:
來源:轉載
供稿:網友

Leftmost Digit Time Limit: 2000/1000 MS (java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 17741 Accepted Submission(s): 6854

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.


需要用到科學記數法和對數運算的知識。 我們把num*num的值記作:num*num=a*10^n,其中1

附上ac代碼:

#include<cstdio>#include<cmath>#include<cstring>#include<iostream>#include<algorithm>using namespace std;typedef long long ll;int main(){ int t; scanf ("%d",&t); while (t--) { ll n; int i,j; double x; scanf ("%lld",&n); x = n*log10(n*(1.0)); x -= (ll)x; int a = pow(10.0,x); printf ("%d/n",a); } return 0;}
發表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發表
主站蜘蛛池模板: 方山县| 长沙市| 四子王旗| 祁东县| 临高县| 泽库县| 九江市| 西平县| 友谊县| 江西省| 内丘县| 宣化县| 将乐县| 克东县| 辽宁省| 祁连县| 西昌市| 临泉县| 且末县| 闻喜县| 资中县| 凤翔县| 平阳县| 赤峰市| 齐河县| 雅安市| 会东县| 休宁县| 青州市| 咸阳市| 菏泽市| 石首市| 准格尔旗| 梨树县| 比如县| 黄山市| 克东县| 绍兴县| 黄山市| 兰坪| 石棉县|