Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def num_divisori(l5,k):
- l2=[]
- for x in l5:
- i=2
- while i<x:
- if x%i==0:
- l2+=[x]
- break
- i=i+1
- return num_div2(l2,k)
- def num_div2(l2,k):
- l3=[]
- l4=[]
- for x in l2:
- i=2
- while i<x:
- if x%i==0:
- l3+=[i]
- i=i+1
- if len(l3)==k:
- l4+=[x]
- l3=[]
- return l4
Add Comment
Please, Sign In to add comment