(num)
| 4875 | ) |
| 4876 | |
| 4877 | def roman_num(num): |
| 4878 | for r, ltr in roman: |
| 4879 | x, _ = divmod(num, r) |
| 4880 | yield ltr * x |
| 4881 | num -= r * x |
| 4882 | if num <= 0: |
| 4883 | break |
| 4884 | |
| 4885 | return "".join([a for a in roman_num(num)]) |
| 4886 |
no outgoing calls
no test coverage detected
searching dependent graphs…