69,365
社区成员
发帖
与我相关
我的任务
分享
#include<stdio.h>
#include<string.h>
#include<memory.h>
#define LEN 1001
main()
{
char arr1[LEN],arr2[LEN],arr3[LEN];
int i,j,n,l,l1,l2,s;
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%s%s",arr1,arr2);
if (j>0) printf("\n");//加:只有在2个CASE之间有换行
printf("Case %d:\n",j+1);//漏了冒号:漏了printf("Case %d\n",j+1);
printf("%s + %s = ",arr1,arr2); //=右边漏了空格:printf("%s + %s =",arr1,arr2);
l1=strlen(arr1);
l2=strlen(arr2);
memset(arr3,'0',LEN);
l=l1>l2?l1:l2;
s=l1<l2?l1:l2;
for(i=0;i<s;i++)
{
arr3[l-i]+=arr1[l1-i-1]+arr2[l2-i-1]-96;
if(arr3[l-i]>'9')
{
arr3[l-i]-=10;
arr3[l-i-1]+=1;
}
}
if(l1-i>0||l2-i>0)
{
if(l2>l1)
strcpy(arr1,arr2);
for(;i<l;i++)
{
arr3[l-i]+=arr1[l-i-1]-48;
if(arr3[l-i]>'9')
{
arr3[l-i]-=10;
arr3[l-i-1]+=1;
}
}
}
arr3[l+1]='\0';
if(arr3[0]=='0')
printf("%s\n",arr3+1);
else
printf("%s\n",arr3);
//只有在2个CASE之间有换行:printf("\n\n");
}
}
#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
#include<stdio.h>
#include<string.h>
#define LEN 1001
int main(void)
{
char a1[LEN], a2[LEN];
int a3[LEN];
int i, j, n, l, l1, l2, s;
scanf("%d", &n);
for(j=0; j<n; j++)
{
scanf("%s %s", a1, a2);
l1 = strlen(a1);
l2 = strlen(a2);
memset(a3, 0, sizeof(a3));
l = l1>l2 ? l1 : l2;
s = l1<l2 ? l1 : l2;
for(i=0; i<s;i++)
{
a3[l-i] += a1[l1-i-1] + a2[l2-i-1]-96;
if(a3[l-i] > 9)
{
a3[l-i] -= 10;
a3[l-i-1] += 1;
}
}
// printf("%s\n", a3);
if(l1-i>0 || l2-i>0)
{
if(l2>l1)
strcpy(a1, a2);
for(; i<l; i++)
{
a3[l-i] += (a1[l-i-1] - 48);
if(a3[l-i]>9)
{
a3[l-i] -= 10;
a3[l-i-1] += 1;
}
}
}
printf("Case %d:\n", j+1);
printf("%s + %s = ", a1, a2);
for(i=0; a3[i]==0; i++)
;
for(; i<=l; i++)
printf("%d", a3[i]);
printf("\n");
}
return 0;
}