【PAT乙级】1017 A除以B (20 分)

https://pintia.cn/problem-sets/994805260223102976/problems/994805305181847552

#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
vector<int> A;
vector<int> mul(vector<int> &A,int b,int & res)
{
	res=0;
	vector<int> C;
	for(int i=A.size()-1;i>=0;i--)
	{
		res=res*10+A[i];
		C.push_back(res/b);
		res%=b;
	}
	reverse(C.begin(),C.end());
	while(C.size()>1&&C.back()==0)  C.pop_back();
	return C;
}
int main(void) 
{
	string a; int b;  cin>>a>>b;
	for(int i=a.size()-1;i>=0;i--) A.push_back(a[i]-'0');
	int res=0;
	auto C=mul(A,b,res);
	for(int i=C.size()-1;i>=0;i--) cout<<C[i];
	cout<<" "<<res<<endl;
	return 0;
}

#include<cstdio>
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
vector<int> A,B;
int main(void)
{
	string a; 
	int b;
	cin>>a>>b;
	for(int i=a.size()-1;i>=0;i--) A.push_back(a[i]-'0');
	int t=0;
	for(int i=A.size()-1;i>=0;i--)
	{
		t=t*10+A[i];
		B.push_back(t/b);
		t=t%b;
	}
	reverse(B.begin(),B.end());
	while(B.size()>1&&B.back()==0) B.pop_back();
	for(int i=B.size()-1;i>=0;i--) cout<<B[i];
	cout<<" "<<t<<endl;
	return 0;
}