(n: int, word: str)
| 101 | |
| 102 | |
| 103 | def count(n: int, word: str) -> str: |
| 104 | if n == 1: |
| 105 | return f"{n} {word}" |
| 106 | else: |
| 107 | return f"{n} {word}s" |
| 108 | |
| 109 | |
| 110 | def printlist(x, width=70, indent=4, file=None): |
no outgoing calls
searching dependent graphs…