Hoi
Hier is de code voor inception juffen:
xoxo
def is_juf(a):
if (a % 7 == 0):
return True
if (a % 11 == 0):
return True
while (a > 0):
if (a % 10 == 7):
return True
a = a // 10
return False
def juf(n):
res = []
nums = [0]
for _ in range(n):
j = 0;
nums[j] += 1
num = nums[j]
while is_juf(num):
j += 1
if len(nums) == j:
nums.append(0)
nums[j] += 1
num = nums[j]
res.append(num)
return res
print(juf(1000))