mirror of
https://github.com/xlucn/PAT.git
synced 2026-10-03 00:23:15 +08:00
49 lines
1.2 KiB
C
49 lines
1.2 KiB
C
/**
|
|
* 1017. A除以B (20)
|
|
*
|
|
* 本题要求计算A/B，其中A是不超过1000位的正整数，B是1位正整数。你需要输出商数Q和
|
|
* 余数R，使得A = B * Q + R成立。
|
|
*
|
|
* 输入格式：
|
|
*
|
|
* 输入在1行中依次给出A和B，中间以1空格分隔。
|
|
*
|
|
* 输出格式：
|
|
*
|
|
* 在1行中依次输出Q和R，中间以1空格分隔。
|
|
*
|
|
* 输入样例：
|
|
* 123456789050987654321 7
|
|
* 输出样例：
|
|
* 17636684150141093474 3
|
|
**/
|
|
|
|
#include <stdio.h>
|
|
|
|
/* read 2 digits from highest digit of A, do manual division, get the quotient
|
|
and remainder. Read one more digit, combine this with the last remainder to
|
|
get a new 2-digits number. Do this until read to the end of A */
|
|
|
|
int main()
|
|
{
|
|
int B;
|
|
char A[1001], *p = A;
|
|
scanf("%s %d", A, &B);
|
|
|
|
/* the results are stored in A and B instead of printed out on-the-fly */
|
|
int twodigit, remainder = 0;
|
|
for(int i = 0; A[i]; i ++)
|
|
{
|
|
twodigit = remainder * 10 + (A[i] - '0');
|
|
A[i] = twodigit / B + '0';
|
|
remainder = twodigit % B;
|
|
}
|
|
B = remainder;
|
|
|
|
/* print */
|
|
if(A[0] == '0' && A[1] != '\0') p++;
|
|
printf("%s %d", p, B);
|
|
|
|
return 0;
|
|
}
|