challenge: generators python | Sololearn: Learn to code for FREE!
0

challenge: generators python

def isPrime(x): if x < 2: return False elif x == 2: return True for n in range(2, x): if x % n ==0: return False return True def primeGenerator(a, b): #your code goes here f = int(input()) t = int(input()) print(list(primeGenerator(f, t))) I dont know why my code's wrong in test case 4

1st Sep 2021, 2:55 AM
Hảo Nguyễn Thiên
Hảo Nguyễn Thiên - avatar
2 ответов
0
someone helps my problem
1st Sep 2021, 2:56 AM
Hảo Nguyễn Thiên
Hảo Nguyễn Thiên - avatar
0
Does your range need to be inclusive of the upper number according to the challenge description? for n in range(2,x+1)
1st Sep 2021, 5:20 AM
Rik Wittkopp
Rik Wittkopp - avatar