add divisors command
This commit is contained in:
parent
e422c83803
commit
e5b3be0e60
|
|
@ -0,0 +1,110 @@
|
|||
/*
|
||||
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"
|
||||
|
||||
"github.com/spf13/cobra"
|
||||
)
|
||||
|
||||
var divisorsN uint
|
||||
|
||||
func updateMultiples(sieve []uint, p uint, n uint) {
|
||||
q := p
|
||||
for {
|
||||
for i := 2 * q; i < n; i += q {
|
||||
if i%(p*q) != 0 {
|
||||
sieve[i] *= sieve[q]
|
||||
}
|
||||
}
|
||||
|
||||
if p*q >= n {
|
||||
break
|
||||
}
|
||||
|
||||
sieve[p*q] = p*q + sieve[q]
|
||||
q *= p
|
||||
}
|
||||
}
|
||||
|
||||
func divisorsSieve(n uint) chan uint {
|
||||
sieve := make([]uint, n)
|
||||
sieve[0] = 0
|
||||
for i := uint(1); i < n; i++ {
|
||||
sieve[i] = 1
|
||||
}
|
||||
|
||||
ch := make(chan uint)
|
||||
go func() {
|
||||
for i := uint(0); i < n; i++ {
|
||||
if i == 0 || i == 1 || sieve[i] != 1 {
|
||||
ch <- sieve[i]
|
||||
continue
|
||||
}
|
||||
|
||||
sieve[i] = i + 1
|
||||
updateMultiples(sieve, i, n)
|
||||
ch <- sieve[i]
|
||||
}
|
||||
|
||||
close(ch)
|
||||
}()
|
||||
|
||||
return ch
|
||||
}
|
||||
|
||||
func divisors(cmd *cobra.Command, args []string) {
|
||||
ch := divisorsSieve(divisorsN)
|
||||
for i := 0; ; i++ {
|
||||
v, ok := <-ch
|
||||
if !ok {
|
||||
break
|
||||
}
|
||||
|
||||
if i == 0 {
|
||||
continue
|
||||
}
|
||||
|
||||
fmt.Println(v)
|
||||
}
|
||||
}
|
||||
|
||||
// divisorsCmd represents the divisors command
|
||||
var divisorsCmd = &cobra.Command{
|
||||
Use: "divisors",
|
||||
Short: "Compute the divisor function for all numbers less than n",
|
||||
Long: `Compute the divisor function for all numbers less than n.`,
|
||||
Run: divisors,
|
||||
}
|
||||
|
||||
func init() {
|
||||
sieveCmd.AddCommand(divisorsCmd)
|
||||
|
||||
// Here you will define your flags and configuration settings.
|
||||
|
||||
// Cobra supports Persistent Flags which will work for this command
|
||||
// and all subcommands, e.g.:
|
||||
// divisorsCmd.PersistentFlags().String("foo", "", "A help for foo")
|
||||
|
||||
// Cobra supports local flags which will only run when this command
|
||||
// is called directly, e.g.:
|
||||
// divisorsCmd.Flags().BoolP("toggle", "t", false, "Help message for toggle")
|
||||
|
||||
divisorsCmd.Flags().UintVarP(&divisorsN, "limit", "n", 0, "upper limit")
|
||||
divisorsCmd.MarkFlagRequired("limit")
|
||||
}
|
||||
Loading…
Reference in New Issue