全部回复 共 2 条

1. 郑帅 #1 楼主 · 2021-12-05

   include <bits/stdc++.h>

   using namespace std;

   int main() {

   char al[100], bl[100];
   int a[101], b[101], c[101], lena, lenb, lenc, i, x;
   memset(a, 0, sizeof(a));
   memset(b, 0, sizeof(b));
   memset(c, 0, sizeof(c));
   gets(al);
   gets(bl);
   lena = strlen(al);
   lenb = strlen(bl);
   for (i = 0; i <= lena - 1; i++)
   	a[lena - i] = al[i] - 48;
   for (i = 0; i <= lenb - 1; i++)
   	b[lenb - i] = bl[i] - 48;
   lenc = 1;
   x = 0;
   while (lenc <= lena || lenc <= lenb) {
   	c[lenc] = a[lenc] + b[lenc] + x;
   	x = c[lenc] / 10;
   	c[lenc] %= 10;
   	lenc++;
   }
   c[lenc] = x;
   if (c[lenc] == 0) {
   	lenc--;
   }
   for (i = lenc; i >= 1; i--) {
   	cout << c[i];
   }
   cout << endl;
   return 0;
   

   }

2. 郑帅 #2 楼主 · 2021-12-05

   include <bits/stdc++.h>

   using namespace std;

   int main() {

   char al[300], bl[300];
   int a[301], b[301], c[301], lena, lenb, lenc, i, x;
   memset(a, 0, sizeof(a));
   memset(b, 0, sizeof(b));
   memset(c, 0, sizeof(c));
   gets(al);
   gets(bl);
   lena = strlen(al);
   lenb = strlen(bl);
   for (i = 0; i <= lena - 1; i++)
   	a[lena - i] = al[i] - 48;
   for (i = 0; i <= lenb - 1; i++)
   	b[lenb - i] = bl[i] - 48;
   lenc = 1;
   x = 0;
   while (lenc <= lena || lenc <= lenb) {
   	c[lenc] = a[lenc] + b[lenc] + x;
   	x = c[lenc] / 10;
   	c[lenc] %= 10;
   	lenc++;
   }
   c[lenc] = x;
   if (c[lenc] == 0) {
   	lenc--;
   }
   for (i = lenc; i >= 1; i--) {
   	cout << c[i];
   }
   cout << endl;
   return 0;
   

   }