I\'ve recently been working on Project Euler problems in Python. I am fairly new to Python, and still somewhat new as a programmer.
In any case, I\'ve ran into a sp
How I can reduce the complexity of this
num = 1 found = False while not found: count =0 for i in range(1, 21): if num %i == 0: count+=1 if count ==10: print(num) found = True num+=1