Function find_prime

find_prime.py:31–37

(num)

def find_prime(num):
    res_list = []
    for i in range(2, num + 1):
        if res_list != [] and any(i % l == 0 for l in res_list):
            continue
        res_list.append(i)
    return res_list


if __name__ == "__main__":