玄关求条
查看原帖
玄关求条
766880
jingliang_youxi楼主2024/10/22 10:58
#include <bits/stdc++.h>
using namespace std;
char a1[1001], b1[1001];
int a[1001], b[1001], c[1001];
bool pd;
int alen, blen;

int main() {
	cin >> a1 >> b1;
	int len = strlen(a1);
	int len1 = strlen(b1);
	if ((a < b && len == len1) || len < len1) {
		swap(a, b);
		pd = true;
	}
	for (int i = len - 1; i >= 0; i--) {
		a[++alen] = a1[i] - 48;
	}
	for (int i = len1 - 1; i >= 0; i--) {
		b[++blen] = b1[i] - 48;
	}
	int m = max(len, len1);
	int len3 = 0;
	int d[100001];
	for (int i = 0; i < m; i++)
		d[i] = 9;
	c[0] += 1;
	while (len3 < m) {
		c[len3] += a[len3] - b[len3] + d[len3];
		if (c[len3] >= 10) {
			c[len3] -= 10;
			++c[len3 + 1];
		}

		len3++;
	}
	while (c[m] == 0)
		m--;
	for (int i = len3 - 1; i >= 0; i--) {
		if (c[i] != 0)
			m++;
	}
	for (int i = m - 1; i >= 0; i--) {
		cout << c[i];
	}
	if (m == 0)
		cout << 0;
	return 0;
}
2024/10/22 10:58
加载中...