|
本帖最后由 ukyo502 于 2015-3-30 08:30 编辑
初等数论中相关思路~~
d:\我的文档\ahailei.png
python 代码
import time
c1=time.time()
#======================================
def gcd(a, b):
if a < b:
a, b = b, a
while b != 0:
temp = a % b
a = b
b = temp
return a
#======================================
D={};count_D=0;Big=15*10**5
for x in xrange(2,int((Big/2)**0.5)):
for y in xrange(x-1,0,-2):
if gcd(x,y)==1:
L=2*x*(x+y)
for L1 in xrange(L,Big,L):
if L1 in D:
D[L1]+=1
else:
D[L1]=1
#==========================================
for z in D:
if D[z]==1:
count_D+=1
print count_D
print time.time()-c1
|
|