Integer Inquiry
2015-08-10 16:41
441 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1047
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int max1;
void turn(int a[],int dig)
{
int t;
for(int i=1;i<=dig/2;i++)
{
t=a[i];
a[i]=a[dig-i+1];
a[dig-i+1]=t;
}
}
void add(int A[],int len1,int S[])
{
int temp[10005];
memset(temp,0,sizeof(temp));
turn(A,len1);
max1=len1;
int len2=0;
for(int i=10004;;i--)
{
if(S[i]!=0)
{
len2=i;
break;
}
}
if(max1<len2)
max1=len2;
for(int k=0,i=1;i<=max1+1;i++)
{
temp[i]=A[i]+S[i]+k;
k=temp[i]/10;
temp[i]%=10;
}
for(int i=1;i<=max1+1;i++)
{
S[i]=temp[i];
}
}
int main()
{
int n;
char a[110];
int A[10005],S[10005];
cin>>n;
getchar();
while(n--)
{
memset(S,0,sizeof(S));
memset(a,0,sizeof(a));
memset(A,0,sizeof(A));
while(cin>>a && strcmp(a,"0")!=0)
{
int len1=strlen(a);
for(int i=0;i<len1;i++)
{
A[i+1]=a[i]-'0';
}
add(A,len1,S);
memset(a,0,sizeof(a));
memset(A,0,sizeof(A));
}
int i;
for(i=max1+1;i>1;i--)
if(S[i])
break;
for(;i>=1;i--)
cout<<S[i];
cout<<endl;
if(n!=0)
cout<<endl;
}
return 0;
}
http://acm.hdu.edu.cn/showproblem.php?pid=1047
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int max1;
void turn(int a[],int dig)
{
int t;
for(int i=1;i<=dig/2;i++)
{
t=a[i];
a[i]=a[dig-i+1];
a[dig-i+1]=t;
}
}
void add(int A[],int len1,int S[])
{
int temp[10005];
memset(temp,0,sizeof(temp));
turn(A,len1);
max1=len1;
int len2=0;
for(int i=10004;;i--)
{
if(S[i]!=0)
{
len2=i;
break;
}
}
if(max1<len2)
max1=len2;
for(int k=0,i=1;i<=max1+1;i++)
{
temp[i]=A[i]+S[i]+k;
k=temp[i]/10;
temp[i]%=10;
}
for(int i=1;i<=max1+1;i++)
{
S[i]=temp[i];
}
}
int main()
{
int n;
char a[110];
int A[10005],S[10005];
cin>>n;
getchar();
while(n--)
{
memset(S,0,sizeof(S));
memset(a,0,sizeof(a));
memset(A,0,sizeof(A));
while(cin>>a && strcmp(a,"0")!=0)
{
int len1=strlen(a);
for(int i=0;i<len1;i++)
{
A[i+1]=a[i]-'0';
}
add(A,len1,S);
memset(a,0,sizeof(a));
memset(A,0,sizeof(A));
}
int i;
for(i=max1+1;i>1;i--)
if(S[i])
break;
for(;i>=1;i--)
cout<<S[i];
cout<<endl;
if(n!=0)
cout<<endl;
}
return 0;
}
相关文章推荐
- animate的{queue:false,duration:400}意思
- Django中的request.GET和request.POST
- Hdu oj 1005 Number Sequence
- UITableView 实现汽车品牌(demo)
- UIMenuController,UIPasteboard:复制,粘贴详细解释
- CodeForces 3D-Least Cost Bracket Sequence
- Flash Builder4.7破解方法
- 控件学习---UITextField---摘自培训资料
- MIUI 6 沉浸式状态栏(Android 4.4以上)
- UVA 1151 Buy or Build
- poj 1458/ hdu 1159 Common Subsequence
- Request的getParameter和getAttribute方法的区别
- Java之GUI编程(一)
- HDU 4027 Can you answer these queries? 线段树水题
- cpuid function
- HDOJ 5357 Easy Sequence DP
- leetcode 115 —— Distinct Subsequences
- Java——GUI
- Sequence contains no matching element
- CF Clique in the Divisibility Graph (DP)