24СʱÈÈÃŰæ¿éÅÅÐаñ    

²é¿´: 964  |  »Ø¸´: 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µÄ»ØÌû

libralibra

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

æôÆï½«¾ü

¡ï ¡ï
Сľ³æ(½ð±Ò+0.5):¸ø¸öºì°ü£¬Ð»Ð»»ØÌû
xzhdty(½ð±Ò+1): »¶Ó­³£À´³ÌÐòÓïÑÔ 2011-07-10 08:17:05
ÒýÓûØÌû:
Originally posted by holmescn at 2011-07-09 10:02:16:
°´ËµÄãÕâ¸öpmlistÏ൱ÓÚÒ»¸öhash£¬Ó¦¸Ã±ÈsetÒª¿ì°¡¡£setÏÔÈ»ÊÇÓõÄÊ÷£¬Ó¦¸ÃÓжþ·Ö·¨ÄǸö²éÕÒЧÂÊ¡£

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

²»¹ý£¬ÎªÊ²Ã´ÎҵijÌÐòÒª±ÈÄãµÄ¿ìÒ»µãµãÄØ¡£ÎҵĴó¸ÅÒª 1.3s£¬ ...

ÎÒÓÃtimer²âÊԵĸü¿ì
CODE:
>>>
10000000 loops, best of 3: 0.0224 usec per loop

¹À¼ÆÊÇÎÒ×Ô¼ºÐ´µÄtic/tocº¯Êý¿ªÏúÌ«´ó?
matlab/VB/python/c++/Javaд³ÌÐòÇë·¢QQÓʼþ:790404545@qq.com
6Â¥2011-07-09 14:21:41
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢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: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µÄ»ØÌû
×î¾ßÈËÆøÈÈÌûÍÆ¼ö [²é¿´È«²¿] ×÷Õß »Ø/¿´ ×îºó·¢±í
[¿¼ÑÐ] 310Çóµ÷¼Á +4 baibai1314 2026-03-16 4/200 2026-03-22 20:19 by edmund7
[¿¼ÑÐ] Ò»Ö¾Ô¸ÎäÀí²ÄÁϹ¤³Ì348Çóµ÷¼Á +5 £þ^£þ©bº¹ 2026-03-19 7/350 2026-03-22 19:44 by ¹«èªåÐÒ£
[¿¼ÑÐ] »·¾³Ñ§Ë¶288Çóµ÷¼Á +6 ƤƤƤ123456 2026-03-22 6/300 2026-03-22 16:52 by i_cooler
[¿¼ÑÐ] 291 Çóµ÷¼Á +3 »¯¹¤2026½ì±ÏÒµÉ 2026-03-21 3/150 2026-03-22 14:26 by ColorlessPI
[¿¼ÑÐ] Çóµ÷¼Á +7 Auroracx 2026-03-22 7/350 2026-03-22 12:38 by ËØÑÕÇã³Ç1988
[¿¼ÑÐ] Ò»Ö¾Ô¸»ªÖпƼ¼´óѧ071000£¬Çóµ÷¼Á +4 ÑØ°¶Óб´¿Ç6 2026-03-21 4/200 2026-03-22 07:21 by ilovexiaobin
[¿¼ÑÐ] 286·ÖÈ˹¤ÖÇÄÜרҵÇëÇóµ÷¼ÁÔ¸Òâ¿ç¿¼£¡ +4 lemonzzn 2026-03-17 8/400 2026-03-21 22:49 by lemonzzn
[¿¼ÑÐ] ×ÊÔ´Óë»·¾³ µ÷¼ÁÉêÇë(333·Ö) +5 holy J 2026-03-21 5/250 2026-03-21 22:42 by Catalysis25
[¿¼ÑÐ] ²ÄÁÏÓ뻯¹¤£¨0856£©304ÇóBÇøµ÷¼Á +3 Çñgl 2026-03-20 7/350 2026-03-21 19:05 by 15709483992
[¿¼ÑÐ] Çóµ÷¼Á +3 .m.. 2026-03-21 4/200 2026-03-21 16:25 by barlinike
[¿¼ÑÐ] 268Çóµ÷¼Á +9 ¼òµ¥µã0 2026-03-17 9/450 2026-03-21 15:37 by lature00
[¿¼ÑÐ] Çóµ÷¼Á +6 Mqqqqqq 2026-03-19 6/300 2026-03-21 08:04 by JourneyLucky
[¿¼ÑÐ] »úеר˶299Çóµ÷¼ÁÖÁ²ÄÁÏ +3 kkcoco25 2026-03-16 4/200 2026-03-21 03:52 by JourneyLucky
[¿¼ÑÐ] Çóµ÷¼Á +3 Ma_xt 2026-03-17 3/150 2026-03-21 02:05 by JourneyLucky
[¿¼ÑÐ] Ò»Ö¾Ô¸Î÷ÄϽ»´ó£¬Çóµ÷¼Á +5 ²Ä»¯ÖðÃÎÈË 2026-03-18 5/250 2026-03-21 00:26 by JourneyLucky
[¿¼ÑÐ] ²ÄÁÏר˶ӢһÊý¶þ306 +7 z1z2z3879 2026-03-18 7/350 2026-03-20 23:48 by JourneyLucky
[¿¼ÑÐ] ÕÐÊÕµ÷¼Á˶ʿ +4 lidianxing 2026-03-19 12/600 2026-03-20 12:25 by lidianxing
[¿¼ÑÐ] 0703»¯Ñ§µ÷¼Á +5 pupcoco 2026-03-17 8/400 2026-03-19 13:58 by houyaoxu
[¿¼ÑÐ] 312Çóµ÷¼Á +8 İå·Ï£ 2026-03-16 9/450 2026-03-18 12:39 by Linda Hu
[¿¼ÑÐ] ¿¼ÑÐÇóµ÷¼Á +3 éÙËÌ. 2026-03-17 4/200 2026-03-17 21:43 by ÓÐÖ»ÀêÅ«
ÐÅÏ¢Ìáʾ
ÇëÌî´¦ÀíÒâ¼û