4
[Golang] Special Pythagorean Triplet - Problem 9 - Project Euler
source link: http://siongui.github.io/2017/06/01/go-special-pythagorean-triplet-problem-9-project-euler/
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
[Golang] Special Pythagorean Triplet - Problem 9 - Project Euler
June 01, 2017
Go solution to special Pythagorean triplet - Problem 9 - Project Euler. [1]
Problem:
A Pythagorean triplet is a set of three natural numbers, a < b < c, for which,
a2 + b2 = c2
For example, 32 + 42 = 9 + 16 = 25 = 52.
There exists exactly one Pythagorean triplet for which a + b + c = 1000.
Find the product abc.
Solution:
200 * 375 * 425 = 31875000
package main
import (
"fmt"
)
func findTriplet() (a, b, c int) {
for a = 1; a < 500; a++ {
for b = a + 1; b < 1000; b++ {
c = 1000 - a - b
if b > c {
break
}
if a*a+b*b == c*c {
return
}
}
}
// cannot find. return all 0
a = 0
b = 0
c = 0
return
}
func main() {
a, b, c := findTriplet()
fmt.Println(a, b, c)
fmt.Println(a * b * c)
}
Tested on Go Playground.
References:
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK