資源簡介
計算黃金分連數小數點后100位
代碼片段和文件信息
#include?
#include?
using?namespace?std;
unsigned?long?long?ab;
#define?min(ab)?(a#define?max(ab)?(a>b?a:b)
string?dao(string?a);
string?quling(string?a);
string?strten(string?a)
{
a+=‘0‘;
return?a;
}
string?jia(string?astring?b)
{
a=dao(a);
b=dao(b);
string?pq;
int?i=0c=0temp;
string?newnum=““;
int?len1=a.length();
int?len2=b.length();
if(len1>len2)
{
p=a;
q=b;
}
else
{
p=b;
q=a;
}
while(q[i]!=‘\0‘)
{
temp=p[i]-‘0‘+q[i]-‘0‘+c;
c=temp/10;
newnum+=temp%10+‘0‘;
i++;
}
while(p[i]!=‘\0‘)
{
temp=p[i]-‘0‘+c;
c=temp/10;
newnum+=temp%10+‘0‘;
i++;
}
if(c==1)
newnum+=‘1‘;
newnum=dao(newnum);?
newnum=quling(newnum);
return?newnum;
}
string?quling(string?a)
{
int?len=a.length()i=0;
string?newnum=““;
while(a[i]==‘0‘){
i++;
}
for(i;i newnum+=a[i];
return?newnum;
}
string?dao(string?a)
{
int?len=a.length();
string?newnum=““;
評論
共有 條評論