设为首页 加入收藏

TOP

hdu 1063 Exponentiation 大数
2015-07-20 18:05:50 来源: 作者: 【 】 浏览:5
Tags:hdu 1063 Exponentiation 大数
Problem 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 R n 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

要求的是一个大数a的n次方  不过还有几个条件,比如例二,小数点前为0要删除;
代码:
import java.math.BigDecimal;
import java.util.Scanner;
public class Main{
	public static void main(String[] srgs)
	{
		Scanner cin =new Scanner(System.in);
		BigDecimal a,s;
		int i,n;
		while(cin.hasNext())
		{
			a=cin.nextBigDecimal();
			n=cin.nextInt();
			s=a;
			for(i=1;i
   
    




】【打印繁体】【投稿】【收藏】 【推荐】【举报】【评论】 【关闭】 【返回顶部
分享到: 
上一篇uva 815 - Flooded!(点名要做的.. 下一篇[Celery]Celery 最佳实践

评论

帐  号: 密码: (新用户注册)
验 证 码:
表  情:
内  容: