2 shunfurh shunfurh 于 2017.01.02 11:11 提问

Exponentiation

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

The input will consist of a set of pairs of values for R and n. The R value will occupy columns 1 through 6, and the n value will be in columns 8 and 9.
Output

The output will consist of one line for each line of input giving the exact value of R^n. Leading zeros should be suppressed in the output. Insignificant trailing zeros must not be printed. 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

1个回答

caozhy
caozhy   Ds   Rxr 2017.01.02 17:50
已采纳
Csdn user default icon
上传中...
上传图片
插入图片
准确详细的回答,更有利于被提问者采纳,从而获得C币。复制、灌水、广告等回答会被删除,是时候展现真正的技术了!
其他相关推荐
ACM刷题之HDU————Exponentiation
Exponentiation Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2584 Accepted Submission(s): 702   Problem Description
Codeforces 913A Modular Exponentiation
题目在这里呀! 模拟。 在计算2^n时如果已经超过m则跳出并输出m。 否则就输出m % 2^n。这样就不会爆了。 #include using namespace std; int main() { int n,m; scanf("%d",&n); scanf("%d",&m); int fac=1,k=0; for(int i=1;im){k=i;break;
poj1001 Exponentiation(JAVA实现)
转载自http://blog.sina.com.cn/s/blog_694034130100wpxj.html http://poj.org/problem?id=1001   题目大意很明了,求一个浮点数R的n次方。结果以0开头时,即0.xxx抹零,保留小数点之后的输出。   代码:   import java.math.BigDecimal; import java.util.
百炼OJ1001
描述 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 sy
[POJ][1001]Exponentiation
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 comp
【POJ 1001】Exponentiation 题解&代码(c++)
poj,高精度,
快速幂取模运算(Modular Exponentiation)
不考虑取模的快速幂运算(迭代法)/* Iterative Function to calculate (x^y) in O(logy) */ int power(int x, unsigned int y) { int res = 1; // Initialize result while (y > 0) { // If y is odd, multip
POJ 百练1001 提示与参考
POJ不提供后台的测试数据,但是这道题的测试数据很可能包含: 10.0 0.0 1.1 0.1 ... 这类数据。 实现的方法: 1、先实现长整数的乘法(不细说) 2、在实现在结果中添加小数点:分三种情况,小数位数k=0,km。 心得: 这道题不要太计较程序的速度,因为数据的量相比计算机的计算能力还是较小的。 因此可以多运用string函数库中的诸如inse
杭电1063 hdu1063Exponentiation
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 com
poj 1001 Exponentiation
poj 1001 Exponentiation用字符串操作的