Python-Project Euler 50
来源:互联网 发布:c语言的创始人 编辑:程序博客网 时间:2024/05/22 10:57
from selectPrime import *
from isPrime import *
prime=[1]*1000005
f=[]
selectPrime(1000000,prime,f)
sum=[0]*100000
sum[1]=f[0]
for i in range(len(f)):
sum[i+1]=sum[i]+f[i]
count=[-1]*1000005
print(len(f))
for i in range(1,len(f)+1):
print(i)
for j in range(i,len(f)+1):
x=sum[j]-sum[i-1]
if x>=1000000:
break
if prime[x]==1:
if j-i>count[x]:
count[x]=j-i
max=-1
l=-1;
for i in range(1,1000005):
if count[i]>max:
max=count[i]
l=i
print(max,' ',l)
from isPrime import *
prime=[1]*1000005
f=[]
selectPrime(1000000,prime,f)
sum=[0]*100000
sum[1]=f[0]
for i in range(len(f)):
sum[i+1]=sum[i]+f[i]
count=[-1]*1000005
print(len(f))
for i in range(1,len(f)+1):
print(i)
for j in range(i,len(f)+1):
x=sum[j]-sum[i-1]
if x>=1000000:
break
if prime[x]==1:
if j-i>count[x]:
count[x]=j-i
max=-1
l=-1;
for i in range(1,1000005):
if count[i]>max:
max=count[i]
l=i
print(max,' ',l)
0 0
- Python-Project Euler 50
- Python-Project Euler 22
- Python-Project Euler 24
- Python-Project Euler 26
- Python-Project Euler 27
- Python-Project Euler 29
- Python-Project Euler 30
- Python-Project Euler 31
- Python-Project Euler 32
- Python-Project Euler 36
- Python-Project Euler 37
- Python-Project Euler 38
- Python-Project Euler 39
- Python-Project Euler 40
- Python-Project Euler 41
- Python-Project Euler 42
- Python-Project Euler 43
- Python-Project Euler 45
- 八个DOS命令
- 代理类
- Vim全图解释
- Hdu2059— 龟兔赛跑 动态规划
- 通过xml处理sql语句时对小于号与大于号的处理转换
- Python-Project Euler 50
- 泛型简单认识
- iOS知识
- 检查表空间是否符合以表空间传递的方式导出
- HTTP协议 (三) 压缩
- API函数IsDBCSLeadByte
- apache cxf之 一个简单的JAX-WS服务程序
- 母牛的故事
- 在Struts2中使用ValueStack、ActionContext、ServletContext、request、session等