POJ1001--Exponentiation(幂计算)翻译

Exponentiation
幂计算
Time Limit: 500MSMemory Limit: 10000K

Total Submissions: 141868Accepted: 34673


Description
描述
Problems involving the computation of exact values of very large magnitude and precision are common.
高精度、大数值的计算问题是很常见的,

For example, the computation of the national debt is a taxing experience for many computer systems.
比如:国债的计算。

This problem requires that you write a program to compute the exact value of Rn where R is a real number ( 0.0 < R < 99.999 ) and n is an integer such that 0 < n <= 25.
现在要求你写一个程序精确计算Rn,其中R是一个实数(0.0 < R < 99.999),n是一个整数,且0 < n <= 25



Input
输入

The input will consist of a set of pairs of values for R and n.
输入包含多组R、n。

The R value will occupy columns 1 through 6, and the n value will be in columns 8 and 9.

R占第1到6列,n占第8到9列。



Output

输出

The output will consist of one line for each line of input giving the exact value of R^n.
对于每组输入,其输出占一行,输出值为R^n。

Leading zeros should be suppressed in the output. Insignificant trailing zeros must not be printed.
不要输出第一位的0,末尾无意义的0也不用输出。

Don't print the decimal point if the result is an integer.
如果结果为整数则不用输出小数部分


Sample Input

95.123 12

0.4321 20

5.1234 15

6.7592 9

98.999 10

1.0100 12


Sample Output

548815620517731830194541.899025343415715973535967221869852721

.00000005148554641076956121994511276767154838481760200726351203835429763013462401

43992025569.928573701266488041146654993318703707511666295476720493953024

29448126.764121021618164430206909037173276672

90429072743629540498.107596019456651774561044010001

1.126825030131969720661201


Hint

提示

If you don't know how to determine wheather encounted the end of input:

如果你不知道如何判定输入是否结束:


s is a string and n is an integer

s是字符串,n是整数。


C++


while(cin>>s>>n)


{


...


}


c


while(scanf("%s%d",s,&n)==2) //to see if the scanf read in as many items as you want


/*while(scanf(%s%d",s,&n)!=EOF) //this also work */


{


...


}

Source

East Central North America 1988


--------------------------------------------------------------------

参考:http://zhidao.baidu.com/link?url=Hw2b3JjT9lRBQx2V28ZGARQBVm4pUrPJ_tZSWvgB0qU1IOxbVYBKYWumKCbP1mnwGEzb3_LVK3iQneDftdepVa

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值