49
Sim0000
● 23 ● 50 ● 65
24346/ 25141
http://checkio.org/user/Sim0000
Last seen 1 day ago
Member for 10 years, 3 months, 1 day
Difficulty Normal
from Japan. hobby programmer. start Python from CheckiO.

Best reviews / Newest reviews
f-string-Sim0000 4
In order to explain what is going on, I rewrote the code. I hope this may help you :-) def time_converter(time): # h, m = map(int, time[:-5].split(':')) splited_time = time[:-5].split(':') # splited_time == "12:30".split(':') == ["12", "30"] h = int(splited_time[0]) # h More
First-junjiru 3 1
You can use int(x, k) to convert k-radix representation to integer. More
First-somanythingstolearn 2 3
Nice! I feel category of this solution should be 3rd party :-) More
First-Sim0000 2 1
Oh, I'm quite new in Python (one week Python coder). So, I don't know any about set. Do you have any material for learning Python set? More
First-mxmaslin 2 1
Your code is very incomplete. Because your code fails for following two example. check_connection(('a-c', 'a-b'), 'a', 'b') check_connection(('aa-b', ), 'a', 'b') Unfortunately checkio tests are incomplete. So incomplete code may pass all tests. Your code treat first occurrence of fir More
Using a small arabic to roman dictionary-LuisLC 2
You can write more simple. for number in key_arabic_numbers: while arabic >= number: arabic -= number roman += arabic_to_roman_dict[number] return roman More simple for number in key_arabic_numbers: n, arabic = divmod(arabic, number) rom More
First-ArkadiuszFrankowiak 1
You can write more compact with **any**. return any(i.endswith(j) for i, j in permutations(words_set, 2)) More
The shortest-MrPod 1 2
You can write all_the_same = lambda e: len(set(e)) < 2 More
First-MBM_1607 1
You can write `self.index = (self.index + 1) % 4` instead of line 8-11. More
The end of me :)-veghadam1991 1
You can write **if word.endswith(ending) and word != ending:** in line 4. More
cheat sheet-gyahun_dash 1 1
Only 14 pattern! Yes, that's right :-) More
First-triclosan 1 1
list(item for item in game_result) is same as game_result. More
First-oduvan 1 1
Youe is_word can be written in one line :-) def is_word(w): return w.isalpha() and all((e in VOWELS) != (o in VOWELS) for e, o in zip(w, w[1:])) More
First-Laertes 1
You can use str.endswith() for this task. More
Second-coells 1 1
I have checked your code for all 5040 case. Then 5 case need 9 steps (5293, 9204, 9214, 9241, 9431). More
Recursive-Sim0000 1
I can write assert scan(iter(expession)) is None instead line 14. More
First-mozurin 1 1
You can omit + 26 in Python :-) More
table-Sim0000 1
I can write **secret_room = T.\_\_getitem\_\_** :-) More
with comment-Sim0000 1
By the way, I never thanked @Splitter . Thanks to your appropriate comments, this code was created. More
log then Halley-Sim0000 1
This code is faster than [previous version](http://www.checkio.org/mission/super-root/publications/Sim0000/python-3/log-then-newton/). See [Halley's method](http://en.wikipedia.org/wiki/Halley%27s_method). More
1
2 3 4 5 6 7