-
Notifications
You must be signed in to change notification settings - Fork 0
/
calcFunctions4.py
89 lines (74 loc) · 1.77 KB
/
calcFunctions4.py
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
from math import factorial as fact
def factorial(numStr):
try:
n = int(numStr)
r = str(fact(n))
except:
r = 'Error!'
return r
def decToBin(numStr):
try:
n = int(numStr)
r = bin(n)[2:]
except:
r = 'Error!'
return r
def binToDec(numStr):
try:
n = int(numStr, 2)
r = str(n)
except:
r = 'Error!'
return r
def decToRoman(numStr):
try:
n = int(numStr)
except:
return 'Error!'
if n >= 4000:
return 'Error!'
romans = [
(1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'),
(100, 'C'), (90, 'XC'), (50, 'L'), (40, 'XL'),
(10, 'X'), (9, 'IX'), (5, 'V'), (4, 'IV'),
(1, 'I')
]
result = ''
for value, letters in romans:
while n >= value:
result += letters
n -= value
return result
def romanToDec(numStr):
values = (('M', 1000),
('CM', 900),
('D', 500),
('CD', 400),
('C', 100),
('XC', 90),
('L', 50),
('XL', 40),
('X', 10),
('IX', 9),
('V', 5),
('IV', 4),
('I', 1))
result = 0
number = []
try:
n = str(numStr)
for i in range(len(numStr)):
for roman, num in values:
while True:
if numStr[i] == roman:
number.append(num)
break
number.append(0)
for i in range(len(numStr)):
if number[i] >= number[i + 1]:
result = result + number[i]
else:
result = result - number[i]
except:
return 'Error!'
return result