Last active
April 14, 2019 16:41
-
-
Save elissonmichael/c2cc65211e4a4065d0000f392879c9f8 to your computer and use it in GitHub Desktop.
Algoritmo para Resolver uma Charada por Força Bruta em Ruby
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
(100..999).each do |x| | |
(100..999).each do |y| | |
(100..999).each do |z| | |
soma = x + y + z | |
condicao1 = soma.digits.size == 3 | |
condicao2 = soma.digits.uniq.size == 1 | |
n = soma.digits.uniq.first | |
condicao3 = n == x.digits.first && n == y.digits.first && n == z.digits.first | |
condicao4 = x.digits.last == y.digits.last && y.digits.last == z.digits.last | |
condicao5 = x.digits[1] == y.digits[1] && y.digits[1] == z.digits[1] | |
if condicao1 && condicao2 && condicao3 && condicao4 && condicao5 | |
puts "#{x} + #{y} + #{z} = #{soma}" | |
end | |
end | |
end | |
end |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment