1017 a divided by B (20 points)

This problem requires calculation A/B, among A No more than 1000 Bit positive integer ,B yes 1 Positive integer . You need to export quotient Q And the remainder R, bring A=B×Q+R establish .

Input format ：

The input is given in turn on a line A and B, In the middle to 1 The blank space to separate .

Output format ：

Output sequentially in a row Q and R, In the middle to 1 The blank space to separate .

sample input ：

123456789050987654321 7

sample output ：

17636684150141093474 3

Ideas ： Any method in the computer is the most advanced method that people think, so we only need to think of the method we think of , If we were to find the divisor and remainder , We will use the division operation we have learned to do , First, let's see if the first digit is less than the divisor , If it's less than , Let's go back , Because there is no number in front , So we can't mark 0, That is to say, the first one is special , Because we are not used to 1456 Make it 01456 In the form of , So the first is special , We need to mark , Then if our current remainder is less than the divisor , We should output 0, No. , We will % operation , So you can get the next time % Value . Special attention should be paid here to the case that the divisor is less than the dividend .

Code ：

#include <bits/stdc++.h>
using namespace std;
int main() {
	char a[1001];
	int number;
	scanf("%s%d",a,&number);
	int i,tool=0;//tool I mean the remainder 
	char b[1001];// Used to record divisors, that is, quotients 
	int size=0;
	memset(b,0,sizeof(b));
	int alen=strlen(a);
	for(i=0; i<alen; i++) {
        tool=tool*10+a[i]-'0';
		if(i==0&&tool<number)continue;// The first special treatment .
		else if(tool<number){// Less than 0 Just throw it in 0
			b[size++]='0';
		}
		else if(tool>=number){// If greater than, take the remainder , And put the business into b Array 
			b[size++]=(char)((tool)/number+'0');
			tool=tool%number;
		}
	}
		if(b[0]!='\0')printf("%s %d",b,tool);
    else printf("0 %d",tool,tool);// If the value is less than the divisor, then the divisor is 0, The remainder is the divisor .
}