我正在尝试在golang中解决project euler problem 3:
问题如下:
13195的主要因子是5、7、13和29。
什么是600851475143的最大素数?
我正在尝试解决以下问题:
package main
import (
"fmt"
)
func primeset(n uint64) uint64 {
primes := uint64(0)
for p:= uint64(2);p <= n;p++ {
if((primes & (1 << p)) == 0){
fmt.Println("Current prime",p)
for j:=uint64(2)*p;j <=n;j=j+p {
fmt.Println("Current num:",j)
primes |= (1 << j)
fmt.Println("Bitset value is:",primes)
}
}
}
return primes
}
func main() {
n := uint64(100)
primes := primeset(n)
fmt.Println("rimes is",primes)
j := n
for j >= 2 {
s := primes & (1 << uint64(j))
if((s == 0) && ((n % j) == 0)){
fmt.Println("Largest factor",j)
return
} else {
j--
}
}
}
Current num: 48
Bitset value is: 375299968947536
Current num: 50
Bitset value is: 1501199875790160
Current num: 52
Bitset value is: 6004799503160656
Current num: 54
Bitset value is: 24019198012642640
Current num: 56
Bitset value is: 96076792050570576
Current num: 58
Bitset value is: 384307168202282320
Current num: 60
Bitset value is: 1537228672809129296
Current num: 62
Bitset value is: 6148914691236517200
Current num: 64
Bitset value is: 6148914691236517200
Current num: 66
Bitset value is: 6148914691236517200
Current num: 68
Bitset value is: 6148914691236517200
Current num: 70
Bitset value is: 6148914691236517200
Current num: 72
Bitset value is: 6148914691236517200
Current num: 74
Bitset value is: 6148914691236517200
Current num: 76
Bitset value is: 6148914691236517200
Current num: 78
Bitset value is: 6148914691236517200
Current num: 80
Bitset value is: 6148914691236517200
Current num: 82
Bitset value is: 6148914691236517200
Current num: 84
Bitset value is: 6148914691236517200
Current num: 86
Bitset value is: 6148914691236517200
The Go Programming Language Specification
<< left shift integer << unsigned integer >> right shift integer >> unsigned integer
The shift operators shift the left operand by the shift count specified by the right operand. They implement arithmetic shifts if the left operand is a signed integer and logical shifts if it is an unsigned integer. There is no upper limit on the shift count. Shifts behave as if the left operand is shifted n times by 1 for a shift count of n.
(1<<p)
其中p > 63
。例如,package main
import (
"fmt"
)
func main() {
primes := ^uint64(0)
fmt.Println(primes)
for _, p := range []uint64{0, 1, 2, 62, 63, 64, 65, 99, 100} {
fmt.Println(p, "\t", primes&(1<<p))
}
}
18446744073709551615
0 1
1 2
2 4
62 4611686018427387904
63 9223372036854775808
64 0
65 0
99 0
100 0
关于go - 没有为数字golang设置位,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/29480420/
欢迎光临 OStack程序员社区-中国程序员成长平台 (https://ostack.cn/) | Powered by Discuz! X3.4 |