http://poj.org/problem?id=1001
原题如下:
Exponentiation
Time Limit: 500MS | Memory Limit: 10000K | |
Total Submissions: 113486 | Accepted: 27528 |
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 n where R is a real number ( 0.0 < R < 99.999 ) and n is an integer such that 0 < n <= 25.
This problem requires that you write a program to compute the exact value of R n 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
题目要求求出浮点数的高精度结果,不限制保留小数点之后几位,所以,需将小数点之后的所有结果,全部求出,代码如下:
#include<iostream>
using namespace std;
#define MAX 150
int first[MAX],second[MAX];
void pow(char base[],int n) //base 有效数字
{
int k=0;
int point=-1;//小数点的位置
int tmp[MAX];//存放临时乘积
//初始化 为0
for(int i=0;i<MAX;i++ )
{
first[i]=second[i]=0;
}
//将输入的底数反过来存入first second
for( i=5;i>=0;i--)
{
if(base[i]!='.')
{
first[k]=second[k++]=base[i]-'0';
}
else //记录小数点的位置
{
point=5-i; // 小数点后面有几位数字
}
}
point=point*n;
//乘方 乘n-1次 first 里面存放的是每次乘方的结果 core
for(i=0;i<n-1;i++)
{
//每次乘方前需要将存放临时结果的tmp清0
for(int j=0;j<MAX;j++)
{
tmp[j]=0;
}
//开始乘方
for( j=0;j<6*(i+1);j++) /// first[j] 数字地一次有效位数5 平方变成10位15 ,20位。。。。
{
for(int k=0;k<6;k++) //second[k]
{
tmp[j+k]+=first[j]*second[k]; //core 结果逐位的乘原数 j表示错位
}
}
//进位
for(k=0;k<5*(i+2); k++)
{
if(tmp[k]>9)
{
tmp[k+1]+=(int)(tmp[k]/10);
tmp[k]=tmp[k]%10;
}
//tmp付给first
first[k]=tmp[k];
}
} //end 乘方
//计算出有效数位的长度
//将数字的前面和后面的小数点去掉
int back=0,front=point ;
for( i=0;i<point;i++) //后面的输出截止点
{
if(first[i]!=0)
{
back=i;
break;
}
}
for(i=5*n-1;i>=point;i--) //前面的输出起点
{
if(first[i]!=0)
{
front=i;
break;
}
}
//将计算结果打印出来
for(int ii=front;ii>=back;ii--)
{
if( ii==point)// 因为是从最右边开始 所以的到ii的时候说明右面还剩ii位数字
{
if(first[ii]!=0)
{
cout<<first[ii]<<".";
}
else cout<<".";
}
else cout<<first[ii];
}
}
int main()
{
char a[7]="0.4321"; //【6】会错误 最后还需一个“ ”
int n=20;
pow(a,n);
return 0;
}
注意;两个数在没有小数点的情况下竖式错位相乘,是解决本题的关键
for( j=0;j<6*(i+1);j++) /// first[j] 数字地一次有效位数5 平方变成10位15 ,20位。。。。
{
for(int k=0;k<6;k++) //second[k]
{
tmp[j+k]+=first[j]*second[k]; //core 结果逐位的乘原数 j表示错位
}
}
{
for(int k=0;k<6;k++) //second[k]
{
tmp[j+k]+=first[j]*second[k]; //core 结果逐位的乘原数 j表示错位
}
}