Exponentiation Time Limit: 500MS Memory Limit: 10000K Total Submissions: 76616 Accepted: 18196 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 //第一次在POJ上通过的一道像样的题,虽然是看了答案 #include <iostream> using namespace std; #define MAX 200 void power(int *a,int base,int n); //求base的n次方 结果存放在数组a中 int main() { char b[20]; int a[MAX]={0}; int n; while(cin>>b>>n) { int len=strlen(b),base=0,i,right=0; for (i=0;i<len;i++) { if(b[i]=='.') { right=len-1-i;//right 为小数的位数 continue; } base=base*10+b[i]-'0'; } if(right) //如果有小数则去掉末尾无用的0 修改right和base { for (i=len-1;b[i]=='0';i--,right--) base/=10; } right*=n; power(a,base,n); for(i=MAX-1;i>=0;i--) //找到第一个不为0的点 即最高位 if (a[i]!=0) break; if (right>i) //无整数位 { cout<<"."; for (int k=right-1;k>=0;k--) cout<<a[k]; } else //有整数位 { for (;i>right-1;i--) cout<<a[i]; if(i>=0) cout<<"."; for(;i>=0;i--) cout<<a[i]; } cout<<endl; } return 0; } void power(int *a,int base,int n) { int j,k,i,set=0; for (k=base,i=0;i<MAX;i++,k/=10) a[i]=k%10; for (i=0;i<n-1;i++) { for (j=0;j<MAX;j++) { a[j]=a[j]*base+set; set=a[j]/10; a[j]=a[j]%10; } } }