login::
pass::
name::
id::
node:
Re[6]: kombinacie
template:
4
parent:
Re[5]: kombinacie
owner:
mimmon
viewed by:
created:
14.12.2011 - 16:08:57
cwbe coordinatez
:
101
63540
2076399
856608
4857954
4858151
4858210
4858425
4858491
4858530
6386100
ABSOLUT
K
YBERIA
permissions
you:
r,
system:
public
net:
yes
⠪
neurons
stats
|
by_visit
|
by_K
source
tiamat
K
|
my_K
|
given_K
last
commanders
polls
total descendants::2
total children::1
show[
2
|
3
]
flat
prvocisla
def divi(a):
for i in range(2,int(sqrt(a))+1):
if not a%i: return [i]+divi(a/i)
return [a]
title/content
title
content
user
000001010006354002076399008566080485795404858151048582100485842504858491048585300638610006452945
repelent
20.01.2012 - 14:21:26
(modif: 20.01.2012 - 14:25:24), level: 1,
UP
NEW
!!CONTENT CHANGED!!
Re[7]: kombinacie
Python (cpython aspon) ma defaultne dost nizky limit na rekurziu (1000), takze radsej by som sa rekurzii vyhol v pripadoch, kde na ten limit mozes narazit. To len tak mimochodom. Pripadne sa da zmenit pomocou sys.setrecursionlimit() ale neviem aky to ma dopad na performance.
edit: a tiez pouzivaj xrange namiesto range ak to pises v python 2.x; xrange vracia generator co je setrnejsie ak a) nepotrebujes celu sekvenciu b) sekvencia je fakt velka. v python 3.x uz range vracia generator
00000101000635400207639900856608048579540485815104858210048584250485849104858530063861000645294506458244
mimmon
23.01.2012 - 14:46:06
, level: 2,
UP
NEW
Re[8]: kombinacie
dakujem za tip
taketo prakticke rady a usmernenia by som potreboval castejsie :)