Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #!/usr/bin/env python3
- import sys
- import math
- def isPrime(number) :
- if number > 1:
- for i in range(2, number):
- if (number % i) == 0:
- return False
- else:
- return True
- else:
- return False
- def prob1(lista):
- primeNum = []
- for element in lista:
- if(isPrime(element)):
- primeNum.append(element)
- n = len(primeNum)
- if(n % 2 == 0):
- return (primeNum[n // 2] + primeNum[n // 2 + 1]) / 2, max(primeNum), primeNum
- else:
- return primeNum[n // 2], max(primeNum), primeNum
- def prob2(lista):
- divizori = [1]
- for element in lista:
- div = 2
- while div <= element:
- if element % div == 0:
- if div not in divizori:
- divizori.append(div)
- div += 1
- n = len(divizori)
- if(n % 2 == 0):
- return (divizori[n // 2] + divizori[n // 2 + 1]) / 2, max(divizori), divizori
- else:
- return divizori[n // 2], max(divizori), divizori
- lista = []
- for i in range(1, len(sys.argv)):
- lista.append(int(sys.argv[i]))
- print(prob1(lista))
- print(prob2(lista))
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement