高级算法与数据结构的解题报告.docVIP

高级算法与数据结构 PKU 1001 Exponentiation 解题报告 老师： 学院： 专业： 姓名： 学号： Exponentiation Time Limit:500MS Memory Limit:10000K 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. Dont print the decimal point if the result is an integer. Sample Input 548815620517731830194541.899025343415715973535967221869852721.00000005148554641076956121994511276767154838481760200726351203835429763013462401 43992025569.928573701266488041146654993318703707511666295476720493953024764121021618164430206909037173276672 90429072743629540498.107596019456651774561044010001 1.126825030131969720661201 Sample Output 95.123 12 0.4321 20 5.1234 15 6.7592 9 98.999 10 1.0100 12 Hint If you dont know how to determine wheather encounted the end of input: s is a string and n is an integer Source East Central North America 1988 语言:c++ #include iostream #include stdlib.h using namespace std; void mult(char a[],char b[],char s[]) { int i,j,k=0,alen,blen,sum=0,res[201][201]={0},flag=0; char result[201]; alen=strlen(a);blen=strlen(b); for (i=0;ialen;i++) for (j=0;jblen;j++) res[i][j]=(a[i]-0)*(b[j]-0); for (i=alen-1;i=0;i--) { for (j=blen-1;j=0;j--) sum=sum+res[i+blen-j-1][j]; result[k]=sum%10; k=k+1; sum=sum/10; } for (i=blen-2