AcWing 794. 高精度除法

思路:由高位到低位依次除，所以数字正序存入容器vector,最后输出时不输出结果前面的0；

#include<iostream>
#include<vector>
using namespace std;
void div(vector<int>& a, int b)
{
	int t = 0;//记录上一位的余数
	vector<int> c;
	for (int i = 0; i < a.size(); i++)
	{
		int k = (a[i]+ 10 * t)/ b;  
		c.push_back(k);
	//	cout << t << endl;
		t = (a[i] + 10 * t) % b;
	//	cout << t << " ";
	}
	//除法去除前置0
	int i = 0;
	while (i < c.size() - 1)
	{
		if (c[i] != 0)
			break;
		else
			i++;
	}
	for(int j = i;j<c.size();j++)
	{
		cout << c[j];
	}
	cout << endl;
	cout << t;

}
int main()
{
	string s;
	vector<int> a, c;
	int b;
	cin >> s >> b;
	for (int i = 0; i < s.size(); i++)
		a.push_back(s[i]-'0');
	div(a, b);
	return 0;
}