poj1001 Exponentiation【java大数】
内容导读
互联网集市收集整理的这篇技术教程文章主要介绍了poj1001 Exponentiation【java大数】，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含2566字，纯文字阅读大概需要4分钟。
内容图文
Exponentiation
| Time Limit: 500MS | Memory Limit: 10000K | |
| Total Submissions: 183034 | Accepted: 44062 |
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 */
{
...
}
Source
East Central North America 1988
题意：
给定一个浮点数R和一个整数n，求R^n
思路：
想给学弟们出一道大数巩固一下。搜到的大数例题。
java BigDecimal自己也都还没用过。
两个点，用 String s = r.pow(n).stripTrailingZeros().toPlainString();使结果不用科学计数法。
注意去掉前导零。比如0.00001要变成 .00001
1 import java.io.EOFException;
2 import java.math.BigDecimal;
3 import java.math.BigInteger;
4 import java.util.Scanner;
5
6 public class Main {
7
8
9 static public void main(String[] args){
10 Scanner scan = new Scanner(System.in);
11 BigDecimal r;
12 int n;
13 while(scan.hasNext()){
14 r = scan.nextBigDecimal();
15 n = scan.nextInt();
16 String s = r.pow(n).stripTrailingZeros().toPlainString();
17 if(s.startsWith("0")){
18 s = s.substring(1);
19 }
20 System.out.println(s);
21 }
22 scan.close();
23 }
24 }
内容总结
以上是互联网集市为您收集整理的poj1001 Exponentiation【java大数】全部内容，希望文章能够帮你解决poj1001 Exponentiation【java大数】所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。
内容备注
版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。
内容手机端
扫描二维码推送至手机访问。