70,037
社区成员
发帖
与我相关
我的任务
分享
int main()
{
vector<int>result;
result.push_back(1);
//cout<<result.size();
for(int i=0;i<1000;i++)
{
vector<int>::size_type n=result.size();
int carry=0;
for(vector<int>::size_type j=0;j<n;j++)
{
result[j]=result[j]*2+carry;
carry=0;
if(result[j]>=10)
{
carry=result[j]/10;
if(j==n-1)
{
result.push_back(carry);//进位
carry=0;
}
result[j]%=10;
}
}
}
for(int i=result.size()-1;i>=0;i--)
cout<<result[i];
system("pause");
return 0;
}
10715086071862673209484250490600018105614048117055336074437503
22493198378815695858127594672917553146825187145285692314043598
45677748242309854210746050623711418779541821530464749835819412
46077062914571196477686542167660429831652624386837205668069376
#include <stdio.h>
#include <string.h>
#define MAXLEN 1000
char a1[MAXLEN];
char a2[MAXLEN];
static int v1[MAXLEN];
static int v2[MAXLEN];
static int v3[MAXLEN];
int i,j,n,L,z;
void main(void) {
scanf("%d",&n);
for (j=0;j<n;j++) {
scanf("%s%s",a1,a2);
L=strlen(a1);
for (i=0;i<L;i++) v1[i]=a1[L-1-i]-'0';
L=strlen(a2);
for (i=0;i<L;i++) v2[i]=a2[L-1-i]-'0';
for (i=0;i<MAXLEN;i++) v3[i]=v1[i]+v2[i];
for (i=0;i<MAXLEN;i++) {
if (v3[i]>=10) {
v3[i+1]+=v3[i]/10;
v3[i]=v3[i]%10;
}
}
printf("Case %d:\n", j+1);
printf("%s + %s = ", a1, a2);
z=0;
for (i=MAXLEN-1;i>=0;i--) {
if (z==0) {
if (v3[i]!=0) {
printf("%d",v3[i]);
z=1;
}
} else {
printf("%d",v3[i]);
}
}
if (z==0) printf("0");
printf("\n");
}
}
//Sample Input
//3
//0 0
//1 2
//112233445566778899 998877665544332211
//
//Sample Output
//Case 1:
//0 + 0 = 0
//Case 2:
//1 + 2 = 3
//Case 3:
//112233445566778899 + 998877665544332211 = 1111111111111111110