-
Notifications
You must be signed in to change notification settings - Fork 22
/
Copy path2.4.5 - Fractions to Decimals.cpp
112 lines (101 loc) · 2.21 KB
/
2.4.5 - Fractions to Decimals.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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
/*
ID: nathan.18
TASK: fracdec
LANG: C++11
*/
#include <iostream>
#include <string>
#include <utility>
#include <sstream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <cassert>
using namespace std;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define INF 1000000000
#define LL_INF 4500000000000000000
#define LSOne(S) (S & (-S))
#define EPS 1e-9
#define A first
#define B second
#define mp make_pair
#define pb push_back
#define PI acos(-1.0)
#define ll long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
vi ans;
int repeatingIndex = INF;
map<ii, int> seen;
int idx = 0;
void divide(int num, int divisor) {
if (num == 0) return;
if (seen.find(mp(num, divisor)) != seen.end()) {
repeatingIndex = seen[mp(num, divisor)];
return;
}
seen[mp(num, divisor)] = idx++;
ans.push_back(num/divisor);
divide((num%divisor)*10, divisor);
}
int numDigits(int num) {
return to_string(num).length();
}
int main() {
freopen("fracdec.in", "r", stdin);
freopen("fracdec.out", "w", stdout);
int n, d; cin >> n >> d;
divide(n, d);
int charCount = 0;
F0R(i, ans.size()) {
if (repeatingIndex == i) {
cout << "(";
charCount++;
}
if (charCount >= 76) {
cout << endl;
charCount = 0;
}
cout << ans[i];
charCount += numDigits(ans[i]);
if (charCount >= 76) {
cout << endl;
charCount = 0;
}
if (i == 0) {
cout << ".";
charCount++;
}
if (charCount >= 76) {
cout << endl;
charCount = 0;
}
}
if (ans.size() == 1) {
cout << "0";
charCount++;
}
if (charCount >= 76) {
cout << endl;
charCount = 0;
}
if (repeatingIndex != INF) {
cout << ")";
charCount++;
}
cout << endl;
return 0;
}