Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Outra posible solución ó reto de maio en Python #16

Merged
merged 7 commits into from
Jun 7, 2017

Conversation

migonzalvar
Copy link
Contributor

No description provided.

@daavoo
Copy link
Contributor

daavoo commented May 6, 2017

🙌

@danybmx
Copy link
Contributor

danybmx commented May 6, 2017

Teño unha dubida con esta solución. Qué fai o range(n) de python? porque se empeza xerando unha lista dende 0 o algoritmo finaliza tan pronto porque atopa a solución.

@migonzalvar
Copy link
Contributor Author

@danybmx tienes razón, la parte de encontrar el límite para 300 segundos no es correcta porque se encuentra solución a la primera

@migonzalvar
Copy link
Contributor Author

@danybmx correxido en 3b9b409

@daavoo
Copy link
Contributor

daavoo commented May 18, 2017

@migonzalvar En:

https://github.com/vigojug/reto/pull/16/files#diff-58d0ac4dada4e8b2ec8aa2489df6887cR15

Non debería ser:

for r in range(1, length + 1):

???
Se non os casos nos que hay que usar todos os números devolve False cando sí hay solución.

@Peque
Copy link
Contributor

Peque commented May 18, 2017

En biggest_set.py es posible que donde hay:

source = range(1, n)

Debiera haber:

source = strategy(n)

Gracias por el código, te lo he copiado todo! 😍 😇

A dormir! 😂

@tomasalmeida tomasalmeida merged commit 8f16672 into VigoTech:master Jun 7, 2017
@migonzalvar migonzalvar deleted the migonzalvar-2 branch June 8, 2017 07:32
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

5 participants