SHOW:
|
|
- or go back to the newest paste.
| 1 | - | // 0011.go contains some functions to solve ProjectEuler.net's Problem #11 |
| 1 | + | // 0012.go contains some functions to solve ProjectEuler.net's Problem #12 |
| 2 | - | // https://projecteuler.net/problem=11 |
| 2 | + | // https://projecteuler.net/problem=12 |
| 3 | package main | |
| 4 | ||
| 5 | - | import ( |
| 5 | + | import "fmt" |
| 6 | - | "fmt" |
| 6 | + | |
| 7 | - | "strings" |
| 7 | + | // CountDivisors returns the count of possible divisors of a given number, |
| 8 | - | "strconv" |
| 8 | + | // including 1 and itself. |
| 9 | - | ) |
| 9 | + | func CountDivisors(number int) int {
|
| 10 | count := 0 | |
| 11 | - | // MaxNumber returns the maximum number in an int array of numbers |
| 11 | + | max := number/2 |
| 12 | - | func MaxNumber(numbers []int) int {
|
| 12 | + | |
| 13 | - | max := 0 |
| 13 | + | for i := 1; i < max; i++ {
|
| 14 | if number%i == 0 {
| |
| 15 | - | for _,i := range numbers {
|
| 15 | + | // Increase count by itself + value (number / i) |
| 16 | - | if i > max {
|
| 16 | + | count += 2; |
| 17 | - | // Replace max with i |
| 17 | + | |
| 18 | - | max = i |
| 18 | + | // Update max number |
| 19 | max = number / i | |
| 20 | } | |
| 21 | - | |
| 21 | + | |
| 22 | - | // Return maximum number |
| 22 | + | |
| 23 | - | return max |
| 23 | + | // Return count |
| 24 | return count | |
| 25 | } | |
| 26 | - | // Make2DIntArray returns a 2D array given a multi-line string of numbers. |
| 26 | + | |
| 27 | - | func Make2DIntArray(numberString string) [][]int {
|
| 27 | + | // FirstTriangularNumber returns the first triangular number with more |
| 28 | - | // Split the string by linebreaks |
| 28 | + | // that the given number of divisors. |
| 29 | - | stringArray := strings.Split(numberString, "\n") |
| 29 | + | func FirstTriangularNumber(numDivisors int) int {
|
| 30 | - | intArray := make([][]int, len(stringArray)) |
| 30 | + | triangularnumber := 0 |
| 31 | count := 0 | |
| 32 | - | for i,v := range(stringArray) {
|
| 32 | + | |
| 33 | - | // Split each line into separate strings |
| 33 | + | for i := 1; count <= numDivisors; i++ {
|
| 34 | - | splitString := strings.Split(v, " ") |
| 34 | + | // Generate triangular number |
| 35 | - | // Create a new array for this particular line |
| 35 | + | triangularnumber += i |
| 36 | - | splitStringArray := make([]int, len(splitString)) |
| 36 | + | |
| 37 | - | |
| 37 | + | // Update divisor count to divisors in current triangular number |
| 38 | - | for j, s := range splitString {
|
| 38 | + | count = CountDivisors(triangularnumber) |
| 39 | - | // Convert each element to number and add to line array |
| 39 | + | |
| 40 | - | splitStringArray[j],_ = strconv.Atoi(s) |
| 40 | + | |
| 41 | // Return triangular number | |
| 42 | return triangularnumber | |
| 43 | - | // Add line array to main int array |
| 43 | + | |
| 44 | - | intArray[i] = splitStringArray |
| 44 | + | |
| 45 | func main(){
| |
| 46 | // Display result | |
| 47 | - | // Return result |
| 47 | + | fmt.Println(FirstTriangularNumber(500)) |
| 48 | - | return intArray |
| 48 | + |