java 大数 acm_Java 解决一些ACM中大数问题

Problem F: Exponentiation

Time Limit: 1 Sec  Memory Limit: 128 MB

Submit: 9

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 \le 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 Rn. Leading zeros and insignificant trailing zeros should be suppressed in the output.

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

大数a的n次幂,直到读到EOF(文件结尾)为止,其中忽略小数后面的0

代码:

1 importjava.math.BigDecimal;2 importjava.util.Scanner;3

4 public classProblem_F_Exponentiation {5

6 public static voidmain(String[] args) {7 Scanner s=newScanner(System.in);8 BigDecimal a;9 intb;10 String c;11 while(s.hasNext()){12 a=s.nextBigDecimal();13 b=s.nextInt();;14 a=a.pow(b).stripTrailingZeros(); //stripTrailingZeros将所得结果小数部分尾部的0去除15 c=a.toPlainString(); //toPlainString将所得大数结果不以科学计数法显示,并转化为字符串16 if(c.charAt(0)=='0')　　　　　　　　//用charAt()判定首位字符是否为017 c=c.substring(1);18 System.out.println(c);19 }20 }21 }

Problem G: If We Were a Child Again

Time Limit: 1 Sec  Memory Limit: 128 MB

Submit: 7  Solved: 6

[Submit][Status][Web Board]

Description

The Problem

The first project for the poor student was to make a calculator that can just perform the basic arithmetic operations.

But like many other university students he doesn’t like to do any project by himself. He just wants to collect programs from here and there. As you are a friend of him, he asks you to write the program. But, you are also intelligent enough to tackle this kind of people. You agreed to write only the (integer) division and mod (% in C/C++) operations for him.

Input

Input is a sequence of lines. Each line will contain an input number. One or more spaces. A sign (division or mod). Again spaces. And another input number. Both the input numbers are non-negative integer. The first one may be arbitrarily long. The second number n will be in the range (0 < n < 231).

Output

A line for each input, each containing an integer. See the sample input and output. Output should not contain any extra space.

Sample Input

110 / 100

99 % 10

2147483647 / 2147483647

2147483646 % 2147483647

Sample Output

1

9

1

2147483646

HINT

大数求余与整除运算

代码:

1 importjava.math.BigInteger;2 importjava.util.Scanner;3 public classMain {4 public static voidmain(String[] args) {5 Scanner s=newScanner(System.in);6 BigInteger a,b,t=new BigInteger("1");7 String c;8 while(s.hasNext()){9 a=s.nextBigInteger();10 c=s.next();11 b=s.nextBigInteger();12 if(c.equals("%")) t=a.mod(b);13 if(c.equals("/")) t=a.divide(b);14 System.out.println(t);15 }16 }17 }