-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFactoriz.py
81 lines (68 loc) · 1.92 KB
/
Factoriz.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Thu Oct 11 18:15:54 2018
@author: qq
"""
from math import sqrt
from threading import Thread, Event
from queue import Queue, Empty
class Hilo(Thread):
def __init__(self, input_div, output_div):
super(Hilo, self).__init__()
self.input = input_div
self.output = output_div
self.end = Event()
def run(self):
while (not self.end.isSet()):
try:
parametros = self.input.get(True, 0.05)
numero = parametros[0]
ini = parametros[1]
fin = parametros[2]
self.output.put(encuentraDivisores(numero, ini, fin))
except Empty:
continue
def join(self, timeout = None):
self.end.set()
super(Hilo,self).join(timeout)
def encuentraDivisores(numero, ini, fin):
lista = []
i = ini
while(i < fin + 1):
if (numero % i == 0):
lista.append(i)
numero = numero // i
lista.append(numero)
i = ini
i += 1
return lista
def divideProblema(numero, hilos):
lista = []
numero_a = 2
div = int(sqrt(numero)) // hilos
for i in range(hilos):
lista.append([numero, numero_a, numero_a + div])
numero_a += div
lista[hilos - 1][2] = int(sqrt(numero)) + 1
return lista
def Main():
input_Queue = Queue()
output_Queue = Queue()
numero = 215517917
hilos = 4
lista = divideProblema(numero, hilos)
print(lista)
pool = [Hilo(input_Queue, output_Queue) for i in range(hilos)]
for thread in pool:
thread.start()
for i in range(hilos):
input_Queue.put(lista[i])
res = []
for i in range(hilos):
pool[i].join()
res += output_Queue.get(True, 0.05)
if res:
print(res)
if __name__ == "__main__":
Main()