/
test.py
84 lines (69 loc) · 1.68 KB
/
test.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
def value(r):
if (r == 'I'):
return 1
if (r == 'V'):
return 5
if (r == 'X'):
return 10
if (r == 'L'):
return 50
if (r == 'C'):
return 100
if (r == 'D'):
return 500
if (r == 'M'):
return 1000
return -1
def converter(str):
res = 0
i = 0
while (i < len(str)):
# Getting value of symbol s[i]
s1 = value(str[i])
if (i + 1 < len(str)):
# Getting value of symbol s[i + 1]
s2 = value(str[i + 1])
# Comparing both values
if (s1 >= s2):
# Value of current symbol is greater
# or equal to the next symbol
res = res + s1
i = i + 1
else:
# Value of current symbol is greater
# or equal to the next symbol
res = res + s2 - s1
i = i + 2
else:
res = res + s1
i = i + 1
return res
def sortRoman(names):
# Write your code here
sort = []
value = []
p = []
vi = []
rn = []
for index, name in enumerate(names):
r = name.split(' ')[1].rstrip()
n = name.split(' ')[0].rstrip()
i = converter(r)
value.append(i)
p.append(n)
vi.append(index)
vi.append(n)
rn.append(r)
print(value)
print(rn)
p.sort()
print(p)
print(vi)
for a in p:
d = a + ' '
o = [i for i, x in enumerate(vi) if x == a]
print(o)
for c in o:
print(vi[c - 1])
sortRoman(['Steven XL', 'Steven XVI', 'David IX',
'Mary XV', 'Mary XIII', 'Mary XX'])