



"""simple docstring"""


snake_case_				     =       [
    (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"""),
]

def  _lowerCAmelCase      (   lowercase_						):
						UpperCAmelCase             = {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}
						UpperCAmelCase             = 0
						UpperCAmelCase             = 0
						while place < len(snake_case_						):
												if (place + 1 < len(snake_case_						)) and (vals[roman[place]] < vals[roman[place + 1]]):
																		total += vals[roman[place + 1]] - vals[roman[place]]
																		place += 2
												else:
																		total += vals[roman[place]]
																		place += 1
						return total

def  _lowerCAmelCase      (   lowercase_						):
						UpperCAmelCase             = []
						for arabic, roman in ROMAN:
												((UpperCAmelCase)      ,    (UpperCAmelCase))             = divmod(snake_case_		,	snake_case_						)
												result.append(roman * factor						)
												if number == 0:
																		break
						return "".join(snake_case_						)


if __name__ == "__main__":
				import doctest

				doctest.testmod()












from math import pi






def lowerCamelCase__    (							snake_case_	:  int       ,      snake_case_	:  int       )      ->				float:
   return 2 * pi * radius * (angle / 360)


if __name__ == "__main__":
    print(arc_length(90, 10))

