Sim0000 profile - python coding challenges

Sim0000

[Follow]

● 23 ● 50 ● 65

24385/ 25141

http://checkio.org/user/Sim0000

Last seen 5 hours ago

Member for 10 years, 4 months

Difficulty Normal

from Japan. hobby programmer. start Python from CheckiO.

Best reviews / Newest reviews

natsuki

First-natsuki 1

You can int instead of floor. More

natsuki

First-natsuki 1

Using set to remove overlap, cool! More

coells

First-coells

Great! Fermat test with 3, 5, 7. More

Sim0000

Recursive-Sim0000

The portion of code below x and f(x[0]) + f(x[1:]) is same as following. [] if x == [] else f(x[0]) + f(x[1:]) More

macfreek

All Math-macfreek

Thank you for the detailed explanation. More

Sim0000

One liner 2nd-Sim0000 1

A little shorter count_gold=f=lambda p,n=0,x=0:n-len(p)and p[n][x]+max(f(p,n+1,x),f(p,n+1,x+1)) More

Sim0000

iter-Sim0000

I was able to improve the code, thanks to the valuable advice. The old code is here. http://www.checkio.org/mission/min-max/publications/Sim0000/python-3/first/ More

macfreek

With exceptions too-macfreek

You can use 'for arg in args' instead of 'try, next, while'. More

Wei5

First-Wei5

Nice hacking! In my local PC, this trick doesn't work. This is because Python 3.3.4 doesn't have \_\_import\_\_.\_\_globals\_\_. CheckiO uses Python 3.3.2. More

Jiyoqisv

First-Jiyoqisv 1

It is not good, because test cases are directly included. More

Sim0000

translate-Sim0000

I can write more simple. See revised version http://www.checkio.org/mission/striped-words/publications/Sim0000/python-3/translate-2/ . More

Sim0000

Second-Sim0000

I should use {a, b} instead of set([a, b]). More

veky

Generatingfunctionology-veky 1

Great generating function! It's quite fast :-) More

ciel

recursive4-ciel 1

You can save 1 char by using s[0]>' ' :-) More

Sim0000

log then Newton-Sim0000

Thanks veky. This version is faster than old one. Here is old version http://www.checkio.org/mission/super-root/publications/Sim0000/python-3/newton-method/ . More