[Golang] Special Pythagorean Triplet - Problem 9 - Project Euler

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,

a² + b² = c²

For example, 3² + 4² = 9 + 16 = 25 = 5².

There exists exactly one Pythagorean triplet for which a + b + c = 1000.

Find the product abc.

Solution:

200 * 375 * 425 = 31875000

Run Code on Go Playground

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:

[1]	Special Pythagorean triplet - Problem 9 - Project Euler