²é¿´: 948  |  »Ø¸´: 6
±¾Ìû²úÉú 2 ¸ö ³ÌÐòÇ¿Ìû £¬µã»÷ÕâÀï½øÐв鿴
µ±Ç°Ö»ÏÔʾÂú×ãÖ¸¶¨Ìõ¼þµÄ»ØÌû£¬µã»÷ÕâÀï²é¿´±¾»°ÌâµÄËùÓлØÌû

holmescn

½ð³æ (ÕýʽдÊÖ)

[½»Á÷] Euler ¹¤³Ì µÚÈýÊ®ÆßÌâ ÒÑÓÐ2È˲ÎÓë

3797Õâ¸öÊýºÜÓÐÒâ˼£¬Ëü±¾ÉíÊÇÒ»¸öÖÊÊý¡£Í¬Ê±£¬ÎÞÂÛÄãÊÇ´Ó×ó±ßɾ³ýÊý×Ö£¬»¹ÊÇ´ÓÓÒ±ßɾ³ýÊý×Ö£¬Ëü»¹ÊǸöÖÊÊý¡£
±ÈÈç´Ó×ó±ßɾ³ýÊý×Ö£º3797£¬797£¬97£¬7
´ÓÓÒ±ßɾ³ýÊý×Ö£º3797£¬379£¬37£¬3

ÕâÑùµÄÖÊÊýÒ»¹²ÓÐ11¸ö¡£Çë¸ø³öËûÃǵĺ͡£

×¢Ò⣺2£¬3£¬5£¬7²»ËãÔÚÄÚ¡£

[ Last edited by holmescn on 2011-7-9 at 09:47 ]
»Ø¸´´ËÂ¥

» ²ÂÄãϲ»¶

» ±¾Ö÷ÌâÏà¹Ø¼ÛÖµÌùÍÆ¼ö£¬¶ÔÄúͬÑùÓаïÖú:

ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

holmescn

½ð³æ (ÕýʽдÊÖ)

¡ï
dubo(½ð±Ò+1): »¶Ó­³£À´³ÌÐòÓïÑÔ°æÌÖÂÛ 2011-07-12 16:15:10
ÒýÓûØÌû:
Originally posted by libralibra at 2011-07-09 00:18:33:
11¸ö°¡ÐÖµÜ,ÄãÀ´¸ö7¸ö,ÎÒÒÔΪÎÒ¸ã´íÁË
Find the sum of the only eleven primes that are both truncatable from left to right and right to left.

Äã½áÊøÖµÌ«Ð¡ÁË,²»¹ý²»È·¶¨"in"ºÍ"[]" ...

¿´À´×òÌì´óÄÔȱÑõÁË£¬¹þ¹þ¡£
4Â¥2011-07-09 09:45:16
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû
²é¿´È«²¿ 7 ¸ö»Ø´ð

holmescn

½ð³æ (ÕýʽдÊÖ)

¡ï ¡ï ¡ï
ÓàÔó³É(½ð±Ò+3, ³ÌÐòÇ¿Ìû+1): ¹ÄÀø½»Á÷£¡ 2011-07-11 20:42:48
PythonÇî¾Ù
CODE:
# Project Euler Problem 37
#

# Gen a prime list
from math import sqrt
UBound = 100000
primes = range(2, UBound)
for x in primes:
    if x > 0:
        for n in xrange(2*x, UBound, x):
            primes[n-2] = 0

# change to a set to make "not in" faster
primes = set([x for x in primes if x > 0])

# Check each prime
for x in primes:
    if x > 10:
        s = str(x)
        flag = True
        for i in xrange(1, len(s)):
            # if any truncated number is not
            # a prime, break and set fail
            if int(s[i:]) not in primes or int(s[:len(s)-i]) not in primes:
                flag = False
                break
        if flag:
            print x

23, 37, 53, 73, 313, 317, 373, 797, 3137, 3797, 739397

ºÍÊÇ748317

[ Last edited by holmescn on 2011-7-9 at 09:52 ]
2Â¥2011-07-08 23:22:21
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

libralibra

ÖÁ×ðľ³æ (ÖøÃûдÊÖ)

æôÆï½«¾ü

¡ï ¡ï ¡ï ¡ï
Сľ³æ(½ð±Ò+0.5):¸ø¸öºì°ü£¬Ð»Ð»»ØÌû
xzhdty(½ð±Ò+1): »¶Ó­³£À´³ÌÐòÓïÑÔ¿´¿´ 2011-07-09 07:01:26
ÓàÔó³É(½ð±Ò+2, ³ÌÐòÇ¿Ìû+1): »¶Ó­³£À´³ÌÐòÓïÑ԰棡 2011-07-11 20:43:27
11¸ö°¡ÐÖµÜ,ÄãÀ´¸ö7¸ö,ÎÒÒÔΪÎÒ¸ã´íÁË
Find the sum of the only eleven primes that are both truncatable from left to right and right to left.

Äã½áÊøÖµÌ«Ð¡ÁË,²»¹ý²»È·¶¨"in"ºÍ"[]"Äĸö¿ì?
Éú³ÉËØÊýÁбíÎÒûÓÐɾ³ý·ÇËØÊý,Ö±½ÓÖÃ0,ÏÂÃæÓÃ[]>0ÅжϵÄ
·¢ÏÖÒ»¸ö¿ÉŵÄÊÂʵ:vimÔËÐÐpython¾¹È»±ÈIDLE¿ì,Õâ¸ö³ÌÐò¿ì1s
IDLEÐèÒª2.9s×óÓÒ
CODE:
11 748317
[23, 37, 53, 73, 313, 317, 373, 797, 3137, 3797, 739397]
Elapsed time: 1.97395228 seconds

CODE:
#! /usr/bin/env python

from mytictoc import tic, toc

tic()

# produce prime list
stop = 1000000
pmlist = range(stop+1)
pmlist[:2] = [0,0]
i = 2
while i*i<=stop:
    if pmlist[i]>0:
        for j in xrange(2*i,stop+1,i):
            pmlist[j] = 0
    i += 1

nums = []
for i in xrange(23,stop+1):
    if pmlist[i]>0 and '0' not in str(i): # isprime and don't contain 0
        # get all sub number
        allnum = []
        for j in xrange(1,len(str(i))):
            allnum.extend([int(str(i)[:j]),int(str(i)[-j:])])
        # check all sub number
        if all([pmlist[x]>0 for x in allnum]):
            nums.append(i)

# print result
print len(nums),sum(nums)
print nums
        
toc()

[ Last edited by libralibra on 2011-7-9 at 01:05 ]
matlab/VB/python/c++/Javaд³ÌÐòÇë·¢QQÓʼþ:790404545@qq.com
3Â¥2011-07-09 00:18:33
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

holmescn

½ð³æ (ÕýʽдÊÖ)

¡ï
dubo(½ð±Ò+1): »¶Ó­³£À´³ÌÐòÓïÑÔ°æÌÖÂÛ 2011-07-12 16:15:16
ÒýÓûØÌû:
Originally posted by libralibra at 2011-07-09 00:18:33:
11¸ö°¡ÐÖµÜ,ÄãÀ´¸ö7¸ö,ÎÒÒÔΪÎÒ¸ã´íÁË
Find the sum of the only eleven primes that are both truncatable from left to right and right to left.

Äã½áÊøÖµÌ«Ð¡ÁË,²»¹ý²»È·¶¨"in"ºÍ"[]" ...

°´ËµÄãÕâ¸öpmlistÏ൱ÓÚÒ»¸öhash£¬Ó¦¸Ã±ÈsetÒª¿ì°¡¡£setÏÔÈ»ÊÇÓõÄÊ÷£¬Ó¦¸ÃÓжþ·Ö·¨ÄǸö²éÕÒЧÂÊ¡£

Ö÷ÒªÊÇÉú³É1000ÍòÒÔϵÄÖÊÊýÓÃʱ̫³¤ÁË¡£

²»¹ý£¬ÎªÊ²Ã´ÎҵijÌÐòÒª±ÈÄãµÄ¿ìÒ»µãµãÄØ¡£ÎҵĴó¸ÅÒª 1.3s£¬ÓÃtime²âÊԵġ£
5Â¥2011-07-09 10:02:16
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû
×î¾ßÈËÆøÈÈÌûÍÆ¼ö [²é¿´È«²¿] ×÷Õß »Ø/¿´ ×îºó·¢±í
[¿¼ÑÐ] 085600²ÄÁÏÓ뻯¹¤µ÷¼Á 324·Ö +8 llllkkkhh 2026-03-18 8/400 2026-03-18 21:01 by Catalysis25
[¿¼ÑÐ] 295Çóµ÷¼Á +3 Ò»Ö¾Ô¸¾©Çø211 2026-03-18 5/250 2026-03-18 17:03 by zhaoqian0518
[¿¼ÑÐ] 085600²ÄÁÏÓ뻯¹¤ +5 °²È«Éϰ¶£¡ 2026-03-16 5/250 2026-03-18 15:33 by cmz0325
[¿¼ÑÐ] 311Çóµ÷¼Á +6 26ÑÐ0 2026-03-15 6/300 2026-03-18 14:43 by haxia
[¿¼ÑÐ] 299Çóµ÷¼Á +5 ¡÷С͸Ã÷* 2026-03-17 5/250 2026-03-18 11:49 by ¾¡Ë´Ò¢1
[¿¼ÑÐ] 303Çóµ÷¼Á +4 î£08 2026-03-17 6/300 2026-03-18 11:01 by Iveryant
[¿¼ÑÐ] ²ÄÁÏ£¬·ÄÖ¯£¬ÉúÎ0856¡¢0710£©£¬»¯Ñ§ÕÐÉúÀ² +3 Eember. 2026-03-17 9/450 2026-03-18 10:28 by Eember.
[¿¼ÑÐ] ¹¤¿Æ²ÄÁÏ085601 279Çóµ÷¼Á +6 À§ÓÚÐdz¿ 2026-03-17 6/300 2026-03-18 10:21 by kkcoco25
[»ù½ðÉêÇë] ±»ÎÒÑÔÖУºÐÂÄ£°å²»Ç¿µ÷¸ñʽÁË£¬¼Ùר¼Ò¿ªÊ¼¹Ü¸ñʽÁË +4 beefly 2026-03-14 4/200 2026-03-17 22:04 by »ÆÄñÓÚ·ÉChao
[¿¼ÑÐ] 326Çóµ÷¼Á +5 Éϰ¶µÄСÆÏ 2026-03-15 6/300 2026-03-17 17:26 by ruiyingmiao
[¿¼ÑÐ] 275Çóµ÷¼Á +4 Ì«Ñô»¨ÌìÌ쿪ÐÄ 2026-03-16 4/200 2026-03-17 10:53 by ¹¦·ò·è¿ñ
[¿¼ÑÐ] 326Çóµ÷¼Á +4 ŵ±´¶û»¯Ñ§½±êéê 2026-03-15 7/350 2026-03-16 17:11 by ŵ±´¶û»¯Ñ§½±êéê
[¿¼ÑÐ] 070300»¯Ñ§Ñ§Ë¶Çóµ÷¼Á +6 Ì«Ïë½ø²½ÁË0608 2026-03-16 6/300 2026-03-16 16:13 by kykm678
[¿¼ÑÐ] 0856ר˶279Çóµ÷¼Á +5 ¼ÓÓͼÓÓÍ£¡? 2026-03-15 5/250 2026-03-15 11:58 by 2020015
[¿¼ÑÐ] 294Çóµ÷¼Á +3 Zys010410@ 2026-03-13 4/200 2026-03-15 10:59 by zhq0425
[¿¼ÑÐ] ¸´ÊÔµ÷¼Á +4 z1z2z3879 2026-03-14 5/250 2026-03-14 16:30 by JourneyLucky
[¿¼ÑÐ] ²ÄÁÏר˶350 Çóµ÷¼Á +4 Íõ½ð¿Æ 2026-03-12 4/200 2026-03-13 16:02 by ruiyingmiao
[¿¼ÑÐ] 290Çóµ÷¼Á +7 ADT 2026-03-12 7/350 2026-03-13 15:17 by JourneyLucky
[¿¼ÑÐ] һ־Ըɽ´ó07»¯Ñ§ 332·Ö ËÄÁù¼¶Òѹý ±¾¿ÆÉ½¶«Ë«·Ç Çóµ÷¼Á£¡ +3 ²»ÏëÀíÄã 2026-03-12 3/150 2026-03-13 14:18 by JourneyLucky
[¿¼ÑÐ] 289Çóµ÷¼Á +3 ÀîÕþÓ¨ 2026-03-12 3/150 2026-03-13 11:02 by Çóµ÷¼Ázz
ÐÅÏ¢Ìáʾ
ÇëÌî´¦ÀíÒâ¼û