my version of @dis.sociat.ing's dollcode algorithm in python

added probably over-engineered check for input

+9 -1
+9 -1
main.py
··· 1 1 import argparse 2 2 3 + 4 + def positive_int(val: str): 5 + ival = int(val) 6 + if ival < 0: 7 + raise argparse.ArgumentTypeError("Number must be non-negative") 8 + return ival 9 + 10 + 3 11 parser = argparse.ArgumentParser(description="converts base-10 number into dollcode") 4 - parser.add_argument("number", type=int, help="number to convert") 12 + parser.add_argument("number", type=positive_int, help="number to convert") 5 13 args = parser.parse_args() 6 14 7 15 DOLLCODE_CHARS = ("▌", "▖", "▘")