POJ 1001

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 Input95.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. 输入为真小数时，即对应例子2输入为 .123 的形式时；
2and3. 幂指数为0或者1的情况；

分析： 考察的是高精度幂数运算以及表示：
表示方面可以用字符数组，这样只要最初定义的数组长度足够，理论上多大的精度咱们都能够用字符数组表示；
既然选择的是字符数组表示输入输出，那么输入的幂运算则可参考正常的手动乘法运算；

代码：可以参考此处的代码 https://blog.csdn.net/Nice_punch/article/details/65119488
感觉思路很清晰，但缺少对三种情况的描述，不过三种情况都极为简单，只需添加进程序即可。