±±¾©Ê¯ÓÍ»¯¹¤Ñ§Ôº2026ÄêÑо¿ÉúÕÐÉú½ÓÊÕµ÷¼Á¹«¸æ
²é¿´: 975  |  »Ø¸´: 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µÄ»ØÌû
×î¾ßÈËÆøÈÈÌûÍÆ¼ö [²é¿´È«²¿] ×÷Õß »Ø/¿´ ×îºó·¢±í
[¿¼ÑÐ] 276Çóµ÷¼Á +3 ÕԾûª 2026-03-29 3/150 2026-03-31 10:06 by cal0306
[¿¼ÑÐ] һ־ԸʳƷ¿ÆÑ§Ó빤³Ì083200Çóµ÷¼Á +4 XQTJZ 2026-03-30 4/200 2026-03-31 04:10 by fmesaito
[¿¼ÑÐ] Ó¢Ò»ÊýÒ»408£¬×Ü·Ö284£¬¶þÕ½Õæ³ÏÇóµ÷¼Á +3 12.27 2026-03-30 5/250 2026-03-31 00:47 by ²»³Ôâ¹û17
[¿¼ÑÐ] Àíѧ07»¯Ñ§ 303Çóµ÷¼Á +4 î£08 2026-03-27 4/200 2026-03-30 23:29 by yujianx
[¿¼ÑÐ] Ò»Ö¾Ô¸»ªÖÐʦ·¶»¯Ñ§332·ÖÇóµ÷¼Á +3 Lyy930824@ 2026-03-29 3/150 2026-03-30 20:15 by DHUSHUAI
[¿¼ÑÐ] 346Çóµ÷¼Á Ò»Ö¾Ô¸070303Óлú»¯Ñ§ +7 Âܲ·ìÀÇà²Ë 2026-03-28 8/400 2026-03-30 19:59 by Î޼ʵIJÝÔ­
[¿¼ÑÐ] 0703 »¯Ñ§ Çóµ÷¼Á£¬Ò»Ö¾Ô¸É½¶«´óѧ 342 ·Ö +7 Shern¡ª- 2026-03-28 7/350 2026-03-30 16:31 by nothingͶ¸åÖÐ
[»ù½ðÉêÇë] ÃæÉÏ5BÄÜÉÏ»áÂ𣿠+7 redcom 2026-03-29 7/350 2026-03-30 12:44 by °®¸ãÑо¿µÄСº¢
[¿¼ÑÐ] µ÷¼ÁÇóԺУÕÐÊÕ +6 º×¾¨¸ë 2026-03-28 6/300 2026-03-29 08:15 by fmesaito
[¿¼ÑÐ] 311£¨085601£©Çóµ÷¼Á +4 liziyeyeye 2026-03-28 4/200 2026-03-28 18:50 by 535743368
[¿¼ÑÐ] 266·Ö£¬Çó²ÄÁÏÒ±½ðÄÜÔ´»¯¹¤µÈµ÷¼Á +7 ÍÛºôºßºôºß 2026-03-27 9/450 2026-03-28 12:22 by zllcz
[¿¼ÑÐ] 352·Ö »¯¹¤Óë²ÄÁÏ +5 º£Äɰٴ¨Ly 2026-03-27 5/250 2026-03-28 03:39 by fmesaito
[¿¼ÑÐ] 0856µ÷¼Á +5 ÇóÇóÈÃÎÒÓÐÊé¶Á° 2026-03-26 6/300 2026-03-27 15:12 by caszguilin
[¿¼ÑÐ] 279 ·Ö Çóµ÷¼Á +4 ˯¸öºÃ¾õ_16 2026-03-24 4/200 2026-03-27 15:05 by ×íÔÚ·çÀï
[¿¼ÑÐ] 315µ÷¼Á +4 0860Çóµ÷¼Á 2026-03-26 5/250 2026-03-27 11:23 by wangjy2002
[¿¼ÑÐ] Ò»Ö¾Ô¸Ö£´ó085600£¬310·ÖÇóµ÷¼Á +5 Àîäì¿É 2026-03-26 5/250 2026-03-27 11:14 by ²»³Ôô~µÄ؈
[˶²©¼ÒÔ°] ±±¾©ÁÖÒµ´óѧ˶µ¼ÕÐÉú¹ã¸æ +6 kongweilin 2026-03-26 8/400 2026-03-27 10:18 by FF_16
[¿¼ÑÐ] Çóµ÷¼Á Ò»Ö¾Ô¸ ±¾¿Æ ±±¿Æ´ó »¯Ñ§ 343 +6 13831862839 2026-03-24 7/350 2026-03-26 22:57 by ²»³Ôô~µÄ؈
[¿¼ÑÐ] ²ÄÁÏÓ뻯¹¤304ÇóBÇøµ÷¼Á +3 Çñgl 2026-03-25 3/150 2026-03-25 19:03 by Ainin_
[¿¼ÑÐ] ¸÷λÀÏʦÄúºÃ£º±¾È˳õÊÔ372·Ö +5 jjÓ¿77 2026-03-25 6/300 2026-03-25 14:15 by mapenggao
ÐÅÏ¢Ìáʾ
ÇëÌî´¦ÀíÒâ¼û