【无标题】SDNU1113

这是只跳跳猴

已于 2023-01-03 19:41:11 修改

阅读量188

点赞数 3

文章标签： c++ 算法

于 2022-10-16 18:52:01 首次发布

本文链接：https://blog.csdn.net/qq_34401767/article/details/127351223

版权

#include <bits/stdc++.h>
using namespace std;

long long p(long long x, long long y) {
	long long w = 1;
	while (y) {
		w = w * x;
		y--;
	}
	return w;
}

int main() {
	string a, b;
	while (cin >> a >> b) {
		long long n1, n2, sum1 = 0, sum2 = 0, x1 = 0, x2 = 0;
		double w1 = 0, w2 = 0;
		n1 = a.size();
		n2 = b.size();
		for (int i = 0; i < n1; i++) {
			if (a[i] == ',' ) {
				sum1++;
			}
		}
		for (int i = 0; i < n2; i++) {
			if (b[i] == ',') {
				sum2++;
			}
		}
		w2 = n2 - sum2;
		w1 = n1 - sum1;
		for (int i = 0; i <= n1 - 1; i++) {
			if (a[i] == ',') {
				continue;
			}

//			cout << a[i] << endl;
//			cout << x1 << endl;
			x1 = (a[i] - 48) * p(10, (w1 - 1) ) + x1;
			w1--;
		}

		for (int i = 0; i <= n2 - 1; i++) {

			if (b[i] == ',') {
				continue;
			}
			x2 = (b[i] - 48) * p(10, (w2 - 1) ) + x2;
//			cout << x2 << endl;
			w2--;
		}

//		cout << x1 << endl;
//		cout << x2 << endl;
		cout << x1 + x2 << endl;
		x1 = 0;
		x2 = 0;
	}
	return 0;
}

。加了一些奇奇怪怪的东西qwq：

#include <bits/stdc++.h>
using namespace std;

long long p(long long x, long long y) {
	long long w = 1;
	while (y) {
		w = w * x;
		y--;
	}
	return w;
}

int main() {
	string a, b;
	while (cin >> a >> b) {
		long long n1, n2, sum1 = 0, sum2 = 0, x1 = 0, x2 = 0;
		double w1 = 0, w2 = 0;
		n1 = a.size();
		n2 = b.size();
		for (int i = 0; i < n1; i++) {
			if (a[i] == ',' || a[i] == '-') {
				sum1++;
			}
		}
		for (int i = 0; i < n2; i++) {
			if (b[i] == ',' || b[i] == '-') {
				sum2++;
			}
		}
		w2 = n2 - sum2;
		w1 = n1 - sum1;
		for (int i = 0; i <= n1 - 1; i++) {
			if (a[i] == ',') {
				continue;
			}
			if (a[i] == '-') {
				continue;
			}
//			cout << a[i] << endl;
//			cout << x1 << endl;
			x1 = (a[i] - 48) * p(10, (w1 - 1) ) + x1;
			w1--;
		}
		if (a[0] == '-') {
			x1 = 0 - x1;
		}
		for (int i = 0; i <= n2 - 1; i++) {
			if (b[i] == '-') {
				continue;
			}
			if (b[i] == ',') {
				continue;
			}
			x2 = (b[i] - 48) * p(10, (w2 - 1) ) + x2;
//			cout << x2 << endl;
			w2--;
		}
		if (b[0] == '-') {
			x2 = 0 - x2;
		}
//		cout << x1 << endl;
//		cout << x2 << endl;
		cout << x1 + x2 << endl;
		x1 = 0;
		x2 = 0;
	}
	return 0;
}