信奥1308

题目：1308高精除

地址 ：http://ybt.ssoier.cn:8088/problem_show.php?pid=1308
类型：模拟

题解:

#include <bits/stdc++.h>

using namespace std;
vector<int> a, b, c, d;
// vector比较方法重载
inline bool operator>(const vector<int> a, const vector<int> b) {
	if (a.size() > b.size())
		return 1;
	if (a.size() < b.size())
		return 0;
	for (int i = 0; i < a.size(); i++) {
		if (a[i] > b[i])
			return 1;
		if (a[i] < b[i])
			return 0;
	}
	return 1;
}
// 减法重载
inline vector<int> operator-(vector<int> a, vector<int> b) {
	vector<int> t;
	reverse(a.begin(), a.end());
	reverse(b.begin(), b.end());
	for (int i = 0; i < a.size(); i++) {
		int n = 0;
		if (i < b.size())
			n = b[i];
		int k = a[i] - n;
		if (k < 0)
			a[i + 1]--, k += 10;
		t.push_back(k);
	}
	for (int i = t.size() - 1; i > 0; i--) {
		if (t[i] == 0)
			t.pop_back();
		else
			break;
	}
	reverse(t.begin(), t.end());
	return t;
}
string x, y;
void turn(string a, vector<int>& b) {
	// reverse(a.begin(), a.end());
	for (int i = 0; i < a.size(); i++) {
		b.push_back(a[i] - '0');
	}
	return;
}
// 累减的方法
// 时间复杂度：300*10*300~=10e6
void div(vector<int> a, vector<int> b) {
	// 比较见上文重载
	int l = 0;
	vector<int> t;
	while (l < a.size()) {
		// c.push_back(0);
		t.push_back(a[l++]);
		int cnt = 0;
		while (t > b) {
			cnt++;
			t = t - b;
		}
		c.push_back(cnt);
	}
	// cout << c.size() << endl;

	reverse(c.begin(), c.end());
	for (int i = c.size() - 1; i > 0; i--) {
		if (c[i] == 0)
			c.pop_back();
		else
			break;
	}
	for (int i = c.size() - 1; i >= 0; i--) {
		cout << c[i];
	}
	cout << endl;
	reverse(t.begin(), t.end());
	for (int i = t.size()-1; i > 0; i++) {
		if (t[i] == 0)
			t.pop_back();
		else
			break;
	}
	for (int i = t.size() - 1; i >= 0; i--) {
		cout << t[i];
	}
	return;
}
int main() {
	cin >> x >> y;
	turn(x, a);
	turn(y, b);
	div(a, b);
	return 0;
}