POJ 1001 Exponentiation 高精度指数
来源:互联网 发布:网络解锁nck 编辑:程序博客网 时间:2024/05/01 17:22
原题:: http://poj.org/problem?id=1001
题目:
Exponentiation
Time Limit: 500MS Memory Limit: 10000K
Total Submissions: 147578 Accepted: 36027
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
Hint
If you don’t know how to determine wheather encounted the end of input:
s is a string and n is an integer
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 /
{
…
}
思路:
求a的b次方,注意要清楚后导0。
c++不好写,java可以直接调用类。
代码:
import java.util.Scanner;import java.math.BigDecimal;public class Main { public static void main(String[] args) { Scanner scanner=new Scanner(System.in); BigDecimal a; int b; while(scanner.hasNext()) { a=scanner.nextBigDecimal(); b=scanner.nextInt(); BigDecimal c=a.pow(b); String s=c.stripTrailingZeros().toPlainString(); if(s.charAt(0)=='0') System.out.println(s.substring(1)); else System.out.println(s); } scanner.close(); } }
- POJ 1001 Exponentiation 高精度指数
- POJ-1001 Exponentiation 高精度
- Exponentiation - POJ 1001 高精度
- poj 1001 (Exponentiation) 高精度乘法
- poj 1001 Exponentiation 高精度乘方
- 【POJ】 1001-Exponentiation 【高精度乘法】
- POJ 1001 Exponentiation (Java高精度)
- POJ 1001 Exponentiation 高精度乘法
- poj 1001 Exponentiation 高精度乘法
- POJ 1001 高精度指数运算
- poj 1001 Exponentiation(高精度乘法)
- poj 1001 Exponentiation 高精度
- POJ 1001 Exponentiation - 高精度高位数运算
- poj 1001Exponentiation||nyoj 155 高精度幂
- 20140709 【高精度浮点数】POJ 1001 Exponentiation
- poj 1001 Exponentiation(求高精度幂)
- POJ 1001 Exponentiation 求高精度幂
- POJ 1001 Exponentiation (高精度/大数乘法)
- UVA 10115
- SPOOLing技术
- 百练6044--鸣人与佐助(BFS)
- Android support v4中的Fragment和app包中的Fragment
- 6. php 基本语法
- POJ 1001 Exponentiation 高精度指数
- NSDate 前一天,或前一周
- IceCave
- 学习 java netty (一) -- java nio
- 基于ArcGIS for Server的服务部署分析
- 广义回归神经网络(GRNN)的数据预测
- SyntaxError: Non-ASCII character Python、Unicode和中文
- 【计蒜客系列】挑战难题22:排序后的数组删除重复数字
- 希尔排序与堆排序(Java版)