Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #Questão 4: Modularização - Divisores de um número
- def divisor(a):
- for i in range(a+1,0,-1):
- if i!=0:
- if (a%i)==0:
- print(a//i)
- def z(a):
- div=0
- for i in range(a+1,0,-1):
- if i!=0 and a!=0:
- if (a%i)==0:
- div+=1
- return(div)
- def segmenesegm(x):
- z(x)
- if z(x)==2:
- return(1)
- elif z(x)==0:
- return(0)
- elif z(x)>2:
- k=0
- for i in range(x+1,0,-1):
- if x%i==0:
- k+=1
- if k==2:
- return(x//i)
- def segmaior(t):
- z(t)
- if z(t)==2:
- return(t)
- elif z(t)==0:
- return(0)
- elif z(t)>2:
- k=0
- for i in range(t+1):
- if i!=0:
- if t%i==0:
- k+=1
- if k==2:
- return(t//i)
- def principal():
- n=int(input())
- divisor(n)
- print(segmenesegm(n),segmaior(n))
- principal()
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement