.
BAN USERdef zeroflipper(s, maxflip):
ones = [0] * maxflip
pos = [-1] * maxflip
maxpos = [-1] * maxflip
flip,length,maxlen = 0,0,0
for i in range(len(s)):
if s[i] == '1':
ones[maxflip-1] += 1
length +=1
else:
if flip < maxflip:
flip += 1
length = sum(ones) + flip
del ones[0]
ones.append(0)
del pos[0]
pos.append(i)
if length > maxlen:
maxlen = length
maxpos = pos[:]
return maxlen, maxpos
def main():
s = '1101100111'
maxflip = 2
print(zeroflipper(s,maxflip))
if __name__ == '__main__':
main()
package main
import "fmt"
func main(){
maxn := 45
num,colhead,coljump,rowjump := 1,1,2,1
for {
if num > maxn {
break
}
fmt.Printf("%02d ",num)
if num + rowjump > maxn {
colhead += coljump
num = colhead
rowjump = coljump
coljump ++
fmt.Println()
} else {
num += rowjump
rowjump ++
}
}
}
def main():
maxn = 45
num = 1
colhead = 1
coljump = 2
rowjump = 1
while True:
if num > maxn:
break
print('{:02d}'.format(num), end = ' ')
if num + rowjump > maxn:
colhead += coljump
num = colhead
rowjump = coljump
coljump +=1
print()
else:
num += rowjump
rowjump+=1
if __name__ == '__main__':
main()
package main
import "fmt"
func main(){
s1 := "wwwwaaadexxxxxx"
s2 := ""
counter := 0
for i:= 0; i< len(s1); i++{
if len(s2) > 0 && s2[len(s2)-1] == s1[i] {
counter ++
} else {
if counter > 1 {
s2 = fmt.Sprint(s2,counter)
}
counter = 1
s2 = fmt.Sprint(s2,s1[i:i+1])
}
}
if counter > 1 {
s2 = fmt.Sprint(s2,counter)
}
fmt.Println(s2)
}
package main
import (
"fmt"
"math"
)
func findPrimes(n int, m map[int]int) {
for i:=3; i< n; i+=2 {
if isPrime(i) {
m[i] = 1
}
}
}
func isPrime(n int) bool {
for i:= 3; i <= int(math.Sqrt(float64(n))); i+=2 {
if n%i == 0 {
return false
}
}
return true
}
func GoldBach(n int, m map[int]int) (x, y int) {
if n < 4 || n%2 != 0 {
return 0,0
}
for k := range m {
if m[n-k] == 1 {
return k, n-k
}
}
return 0,0
}
func main(){
n := 44444
m := make(map[int]int)
m[2] = 1
findPrimes(n,m)
fmt.Println(GoldBach(n,m))
}
#Goldbach
def Goldbach(n,s):
if n< 4 or n%2 != 0:
return 0,0
for i in s:
if (n-i) in s:
return i, n-i
return 0,0
def findPrimes(s,n):
for i in range(3,n,2):
if i >= n:
return
if isPrime(i):
s.add(i)
def isPrime(n):
for i in range(3, int(n**0.5), 2):
if n%i == 0:
return False
return True
def main():
n=44444
s = {2}
findPrimes(s,n)
print(Goldbach(n,s))
if __name__ == '__main__':
main()
- . October 25, 2014