2025-08-12 00:43:19 +00:00
|
|
|
/*
|
|
|
|
|
Copyright © 2025 filifa
|
|
|
|
|
|
|
|
|
|
This program is free software: you can redistribute it and/or modify
|
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
|
*/
|
|
|
|
|
package cmd
|
|
|
|
|
|
|
|
|
|
import (
|
|
|
|
|
"fmt"
|
|
|
|
|
"log"
|
|
|
|
|
"math/big"
|
|
|
|
|
|
|
|
|
|
"github.com/spf13/cobra"
|
|
|
|
|
)
|
|
|
|
|
|
2025-08-12 00:59:43 +00:00
|
|
|
var extended bool
|
|
|
|
|
|
2025-08-12 03:36:54 +00:00
|
|
|
func computeBezouts(bezouts []big.Int, x, y *big.Int) {
|
2025-08-12 03:39:14 +00:00
|
|
|
for i, b := range bezouts {
|
2025-08-12 03:36:54 +00:00
|
|
|
if i == len(bezouts)-1 {
|
|
|
|
|
bezouts[i].Set(y)
|
|
|
|
|
} else {
|
2025-08-12 03:39:14 +00:00
|
|
|
bezouts[i].Mul(&b, x)
|
2025-08-12 03:36:54 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2025-08-12 00:43:19 +00:00
|
|
|
func gcd(cmd *cobra.Command, args []string) {
|
2025-08-12 03:24:09 +00:00
|
|
|
x := new(big.Int)
|
|
|
|
|
y := new(big.Int)
|
|
|
|
|
z := new(big.Int)
|
|
|
|
|
w := new(big.Int)
|
2025-08-12 00:43:19 +00:00
|
|
|
|
2025-08-12 03:11:15 +00:00
|
|
|
bezouts := make([]big.Int, len(args))
|
2025-08-12 00:59:43 +00:00
|
|
|
|
2025-08-12 02:54:43 +00:00
|
|
|
for i, s := range args {
|
2025-08-12 00:43:19 +00:00
|
|
|
_, ok := w.SetString(s, 10)
|
|
|
|
|
if !ok {
|
|
|
|
|
log.Fatal("invalid input " + s)
|
|
|
|
|
}
|
|
|
|
|
|
2025-08-12 03:24:09 +00:00
|
|
|
z.GCD(x, y, z, w)
|
2025-08-12 02:54:43 +00:00
|
|
|
|
2025-08-12 03:36:54 +00:00
|
|
|
if extended {
|
|
|
|
|
computeBezouts(bezouts[:i+1], x, y)
|
2025-08-12 02:54:43 +00:00
|
|
|
}
|
2025-08-12 00:43:19 +00:00
|
|
|
}
|
|
|
|
|
|
2025-08-12 03:24:09 +00:00
|
|
|
fmt.Print(z)
|
2025-08-12 00:59:43 +00:00
|
|
|
if extended {
|
2025-08-12 03:39:14 +00:00
|
|
|
for _, b := range bezouts {
|
|
|
|
|
fmt.Printf(" %s", &b)
|
2025-08-12 02:54:43 +00:00
|
|
|
}
|
2025-08-12 00:59:43 +00:00
|
|
|
}
|
2025-08-12 03:05:29 +00:00
|
|
|
fmt.Println()
|
2025-08-12 00:43:19 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// gcdCmd represents the gcd command
|
|
|
|
|
var gcdCmd = &cobra.Command{
|
2025-08-12 00:48:06 +00:00
|
|
|
Use: "gcd N N [N ...]",
|
2025-08-12 00:43:19 +00:00
|
|
|
Short: "Compute the greatest common denominator of a set of numbers",
|
|
|
|
|
Long: `Compute the greatest common denominator of a set of numbers.`,
|
|
|
|
|
Args: cobra.MinimumNArgs(2),
|
|
|
|
|
Run: gcd,
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func init() {
|
|
|
|
|
rootCmd.AddCommand(gcdCmd)
|
|
|
|
|
|
|
|
|
|
// Here you will define your flags and configuration settings.
|
|
|
|
|
|
|
|
|
|
// Cobra supports Persistent Flags which will work for this command
|
|
|
|
|
// and all subcommands, e.g.:
|
|
|
|
|
// gcdCmd.PersistentFlags().String("foo", "", "A help for foo")
|
|
|
|
|
|
|
|
|
|
// Cobra supports local flags which will only run when this command
|
|
|
|
|
// is called directly, e.g.:
|
|
|
|
|
// gcdCmd.Flags().BoolP("toggle", "t", false, "Help message for toggle")
|
2025-08-12 00:59:43 +00:00
|
|
|
|
|
|
|
|
gcdCmd.Flags().BoolVarP(&extended, "extended", "e", false, "also compute the Bezout coefficients")
|
2025-08-12 00:43:19 +00:00
|
|
|
}
|