-
Notifications
You must be signed in to change notification settings - Fork 1
/
1997 S5 - Long Division.cpp
96 lines (82 loc) · 3.09 KB
/
1997 S5 - Long Division.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
/*
1997 S5 - Long Division
Difficulty: Medium
This question is literaly just implementation.
This the kind of thing you write for a high school computer science project
*/
#include <iostream>
#include <string>
int main(){
int n;
std::cin >> n;
while (n--){
std::string num1, num2;
std::cin >> num1 >> num2;
std::string counter = ""; //Our answer
//Go left to right
for (int right = num2.length() - 1; right < num1.length(); right++){
int count = 0; //Number of times we can subtract
while (true){
//Check which is bigger
bool num1Bigger = true;
for (int i = 0; i <= right; i++){
if (num1[i] - '0' > num2[i] - '0'){
break;
}
else if (num1[i] - '0' < num2[i] - '0'){
num1Bigger = false; break;
}
}
//If num1 is bigger, do subtraction
if (num1Bigger){
//Go right to left, perform manual subtraction
int carryover = 0;
for (int i = right; i >= 0; i--){
//Convert char to int using ASCII codes, remember carryover
int top = num1[i] - '0' + carryover, bottom = num2[i] - '0', difference;
//If we need to borrow
if (top < bottom){
top += 10;
carryover = -1; //Carryover into next iteration
difference = top - bottom;
num1[i] = char ('0' + difference);
}
//Perform normally
else{
num1[i] = char ((top - bottom) + '0');
carryover = 0;
}
}
}
//If num1 smaller, then we stop since we don't go negative
else{
break;
}
count++;
}
num2 = '0' + num2; //To simulate going left to right, we basically just pad the left side of second string with zeros
counter += char (count + '0'); //Add count to counter
}
//Since we padded our answer and numbers with zeros, we have to ignore them now
int i = 0;
for (; i < counter.length(); i++){
if (counter[i] != '0') break;
}
if (i == counter.length()) std::cout << '0'; //If it's all zero
for (; i < counter.length(); i++){
std::cout << counter[i];
} std::cout << '\n';
i = 0;
for (; i < num1.length(); i++){
if (num1[i] != '0') break;
}
if (i == num1.length()) std::cout << '0';
for (; i < num1.length(); i++){
std::cout << num1[i];
}
//To deal with whitespace error
if (n != 0) std::cout << "\n\n";
else std::cout << '\n';
}
return 0;
}