poj 1001 解题报告

最新推荐文章于 2019-07-28 01:27:43 发布

one-point

最新推荐文章于 2019-07-28 01:27:43 发布

阅读量454

点赞数

分类专栏： acm

本文链接：https://blog.csdn.net/u013379988/article/details/17980377

版权

acm 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

Exponentiation

Time Limit: 500MS		Memory Limit: 10000K
Total Submissions: 115607		Accepted: 28068

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 ⁿ 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

Sample Output

548815620517731830194541.899025343415715973535967221869852721
.00000005148554641076956121994511276767154838481760200726351203835429763013462401
43992025569.928573701266488041146654993318703707511666295476720493953024
29448126.764121021618164430206909037173276672
90429072743629540498.107596019456651774561044010001
1.126825030131969720661201

本题难点在于对数据的输出，考虑到数据存在首为0或末尾0等各种情况，首先将字符串倒序保存在整形数组里，

然后将用k储存该需要求幂数的值（去小数点），接着进行求小数对应的整数的幂；输出数据时，先要判断小数点位移数是否大于求得数组长度，如果大于，则表明该值只有小数部分，反之输出整数部分；再判断该小数点位移数与求得数的末尾0个数大小，如果小，则表明该结果只有整数部分，小数部分为0，反之输出小数部分；

//源代码如下：

#include <stdio.h>

#include <string.h>

int main()

{

         char s[6];

         int n;

     int a[130];

        int zan, next;

     int i, j, flag;

    int lena,k;

       while (scanf("%s%d",s,&n)!=EOF)

    {

          memset(a, 0, sizeof(a));

                  lena = k = 0;

             for(i=5; i>=0; i--)

                {

                        if(s[i]!='.')

                    {

                               a[lena++] = s[i]-'0';

                    }

                        else

                     {

                               flag = 5 - i;

                    }

         }

 

           for (i=lena-1; i>=0; i--)

                  {

                        k = k*10+a[i];

            }

               //倒着进行求幂；

                 for(i=0; i<n-1; i++)

               {

                        for(j=0; j<lena; j++)

                     {

                               a[j] *= k;

                       }

                        zan = next = 0;

                          for(j=0; j<lena; j++)

                     {

                               a[j] = a[j]+next;

                                zan = a[j];

                             next = a[j]/10;

                                 a[j] = zan;

                      }

                          while(next!=0)

                           {

                              a[lena++] = next;

                               next /= 10;

                      }

                 }

                k = flag*n;//小数点位移数；

             //如果小数点位移数小于数组的长度，输出整数部分；

                 for(i=lena-1; i>=k; i--)

           {

                        printf("%d", a[i]);

                }

  

                 //记录末尾为零的的个数；

             i = 0;

            while (a[i]==0)  i++;

  

            //末尾零的个数小于小数点位移数，输出小数点；

           if(k>i)

                           printf(".");

             //输出小数点后面的数；

               for (j=k-1; j>=i; j--)

                    printf("%d", a[j]);

               printf("\n");

      }

 

    return 0;

}