Python conversion from Roman to Arabic

Write a program that converts Roman numerals into ordinary numbers. Here are the conversions: M=1000, D=500, C=100, L=50, X=10, V=5 I=1. Don’t forget about things like IV being 4 and XL being 40.

numerals = {'I':1, 'V':5, 'X':10, 'L':50, 'C':100, 'D':500, 'M':1000}
U = []
for i in numerals:
    U.append(i)
enter_num = input('Enter the number for coversion from romans to arabic numbers: ')
L = []
L = list(enter_num)
t = 0K = []
O = []
minus = []
indexi_O = []
for i in L:
    K.append(numerals[i])
for i in K:
    O.append(int(i))
for i in range(len(O)):
    if 0 <= i <len(O)-1 and O[i] < O[i+1]:
        t = O[i+1] - O[i]
        minus.append(t)
        c = i + 1        p = i
        indexi_O.append(c)
        indexi_O.append(p)
    t = 0indexi_O.sort()
for i in range(len(indexi_O)-1, -1, -1):
    del O[indexi_O[i]]
print(enter_num, ' = ', sum(O) + sum(minus))


SOLUTION:

Enter the number for coversion from romans to arabic numbers: MMDCCXCIX
MMDCCXCIX  =  2799



































Коментари











Постави коментар
























Популарни постови са овог блога









Python read from text file V find average points per game




















Слика







 Find all the teams that averaged at least 115 points a game.                          basketball = [line.strip() for line in open ( 'C:/Users/ZM/Desktop/Documents/New folder/basketball1.txt' )]  basketball1 = [line.split( ' \t ' ) for line in basketball]  counter1 = 0  counter2 = 0  K = []  for i in range ( len (basketball1)):      if basketball1[i][ 0 ] not in K:        K.append(basketball1[i][ 0 ])      if   basketball1[i][ 2 ] not in K:        K.append(basketball1[i][ 2 ])  C = []  overall = []  for i in K:      for j in basketball1:          if i in j:              if i == j[ 0 ]:                  counter1 += int (j[ 1 ])              if i == j[ 2 ]:    ...








Прикажи све










Python game Jotto





















  This problem is about a version of the game Jotto. The computer chooses a random five-letter word with no repeat letters. The player gets several turns to try to guess the computer’s word. On each turn, the player guesses a five-letter word and is told the number of letters that their guess has in common with the computer’s word.          from random import choice  enter_lenght = eval ( input ( 'Enter number of letters: ' ))  wordlist = [line.strip() for line in open ( 'C:/Users/ZM/Desktop/Documents/New folder/wordlist.txt' )]  word = ''  K = []  for i in wordlist:      if len (i) == enter_lenght:          K.append(i)  word = choice(K)  d = {}  d1 = {}  c = 0  for i in word:      if i in d1:          d1[i] += 1      else :          d1[i] = 1  print (word)  t = 0  while t <= enter_lenght:      user_word = input ( 'Enter ...








Прикажи све










Python DNA sequencing





















 Suppose you are given the following list of strings:   L = ['aabaabac', 'cabaabca', 'aaabbcba', 'aabacbab', 'acababba']    Patterns like this show up in many places, including DNA sequencing. The user has a  string of their own with only some letters filled in and the rest as asterisks. An example  is a**a****. The user would like to know which of the strings in the list fit with their pattern.  In the example just given, the matching strings are the first and fourth. One way to  solve this problem is to create a dictionary whose keys are the indices in the user’s string of  the non-asterisk characters and whose values are those characters. Write a program implementing  this approach (or some other approach) to find the strings that match a user-entered    string.   L = [ 'aabaabac' , 'cabaabca' , 'aaabbcba' , 'aabacbab' , 'acababba' ]  user = 'a**a****'  d = {}  d_user = {}  T = []  counter1 = 0  ...








Прикажи све