-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathchallenge06.rb
54 lines (46 loc) · 1.36 KB
/
challenge06.rb
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
# Euler Challenge 6
# Find the difference between some of squares and square of sums
# for all numbers within a given number
numbersArray = []
# Get the number we are going to generate squares for
def getMainNumber()
validNum = false
while validNum == false
puts "Please enter the number we will be working with."
givenNumber = gets.chomp
if (givenNumber.to_i.to_s == givenNumber)
validNum = true
else
puts "That does not appear to be a number. No spaces please."
end
end
return givenNumber.to_i
end
# generate hash of numbers consisting of 1 through the givenNumber
def genHash(givenNumber, numbersArray)
1.upto(givenNumber){|x| numbersArray.push(x.to_i)}
end
# Find sum of all squares
def sumOfSquares(numbersArray)
sum = 0
numbersArray.each{|x| sum = sum + (x*x)}
puts "The sum of each number squared is: " + sum.to_s
return sum
end
# Find square of all sums
def squareOfSums(numbersArray)
sum = numbersArray.inject {|x, sum| sum + x}
square = sum*sum
puts "The square of all sums is: " + square.to_s
return square
end
# main container for program
def mainContainer(numbersArray)
givenNumber = getMainNumber()
genHash(givenNumber, numbersArray)
sumsquares = sumOfSquares(numbersArray)
squaresums = squareOfSums(numbersArray)
puts "The difference is: " + (squaresums - sumsquares).to_s
end
# Call to kick off the program
mainContainer(numbersArray)