def S(L):
from sympy.ntheory.generate import primerange
import time
start = time.time()
primes = primerange(1, L)
out = 0
for p in primes:
if p % 100 == 1: print p, time.time() - start
out = (out + s(p)) % 1000000009
return out
def main():
"""Main program."""
answer = 10**7
start_time = time.time()
choose = 5
limit = 2 * 10**4
primes = list(primerange(3, limit))
pairs = {}
for prime_n in primes:
prime_set = build_prime_set(choose, [prime_n], primes, pairs, answer)
if prime_set:
answer = sum(prime_set)
end_time = time.time()
print("The answer is %d" % answer)
print("%f seconds elapsed." % (end_time - start_time))
import pyperclip
pyperclip.copy(str(answer))
print("The answer has been placed in the clipboard.")
def main():
"""Main application."""
answer = 0
start_time = time.time()
choose = 5
limit = 10**4
primes = list(primerange(3, limit))
while answer == 0:
prime_n = primes.pop(0)
prime_set = build_prime_set(choose, [prime_n], primes)
answer = sum(prime_set)
end_time = time.time()
print("The answer is %d" % answer)
print("%f seconds elapsed." % (end_time - start_time))
import pyperclip
pyperclip.copy(str(answer))
print("The answer has been placed in the clipboard.")
def main():
starttime = time.clock()
result = []
G=nx.Graph()#we can consider every pair is a edge. then focus the edges
lst = [comb for comb in combinations(primerange(1,10000),2) if pp(comb)]
G.add_edges_from(lst)
for e in G.edges():
neig = set(G.neighbors(e[0])).intersection(set(G.neighbors(e[1])))
if len(neig)>=3:
for comb in combinations(neig,3):
if G.has_edge(comb[0], comb[1]):
if G.has_edge(comb[0], comb[2]):
if G.has_edge(comb[1], comb[2]):
t = sorted((e[0],e[1],comb[0],comb[1],comb[2]))
if t not in result:result.append(t)
print min(map(sum,result))
print result
endtime = time.clock()
print "running time is %f second" % (endtime - starttime)
def primeslist(a, b):
primes = list(primerange(a, b))
return primes
'''
import time
import networkx as nx
from itertools import combinations
from sympy.ntheory.generate import primerange,isprime
def pp(lst):
return isprime(int("".join([str(lst[0])+str(lst[1])]))) and \
isprime(int("".join([str(lst[1])+str(lst[0])])))
starttime = time.clock()
result = []
G=nx.Graph()#we can consider every pair is a edge. then focus the edges
lst = [comb for comb in combinations(primerange(1,10000),2) if pp(comb)]
G.add_edges_from(lst)
for e in G.edges():
neig = set(G.neighbors(e[0])).intersection(set(G.neighbors(e[1])))
if len(neig)>=3:
for comb in combinations(neig,3):
if G.has_edge(comb[0], comb[1]):
if G.has_edge(comb[0], comb[2]):
if G.has_edge(comb[1], comb[2]):
t = sorted((e[0],e[1],comb[0],comb[1],comb[2]))
if t not in result:result.append(t)
print min(map(sum,result))
print result
endtime = time.clock()
def check_corpus(a_quo_sfactors,a_rest_sfactors,b_quo_sfactors,b_rest_sfactors):
if a_quo_sfactors in Number() and \
a_rest_sfactors in Number() and \
b_quo_sfactors in Number() and \
b_rest_sfactors in Number():
return True
return False
while 1:
N = 4500 # level 1
N =200000 # Level 2
NB_REQUESTS = 500
Number.reset()
primes_N = primerange(0,N)
# Your socket librairy
# client = Server('finale-challs.rtfm.re',5557)# level 2
# client = Server('finale-challs.rtfm.re',5555)# level 1
client = Server('127.0.0.1',4242,logLevel=logging.DEBUG) # local test
resp = client.recvUntil("[.] 3 - Quitter\n")
# resp = resp.decode('utf-8')
resp = resp.split('\n')
for r in resp:
if "tu pourras rentrer lignes par ligne des expressions comme" in r:
resp_first = r.split(' ')[-1][:-2]
if "L'expression indiquée correspond à un nombre entre 2 et " in r:
p = int(r.split(',')[0].split('et ')[1])+1
