Sim0000 profile - python coding challenges

Sim0000

[Follow]

● 23 ● 50 ● 65

24346/ 25141

http://checkio.org/user/Sim0000

Last seen 2 hours ago

Member for 10 years, 3 months, 3 days

Difficulty Normal

from Japan. hobby programmer. start Python from CheckiO.

Best reviews / Newest reviews

Sim0000

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

junjiru

First-junjiru 3 1

You can use int(x, k) to convert k-radix representation to integer. More

LuisLC

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

somanythingstolearn

First-somanythingstolearn 2 3

Nice! I feel category of this solution should be 3rd party :-) More

Sim0000

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

mxmaslin

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

Sim0000

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

mozurin

First-mozurin 1 1

You can omit + 26 in Python :-) More

z_kro

Mod 9, 8, 7-z_kro 1

You can calculate answer x = (280*a + 441*b + 288*c) % 504, where a = x % 9, b = x % 8, c = x % 7. More

veghadam1991

The end of me :)-veghadam1991 1

You can write **if word.endswith(ending) and word != ending:** in line 4. More

MBM_1607

First-MBM_1607 1

You can write `self.index = (self.index + 1) % 4` instead of line 8-11. More

Sim0000

table-Sim0000 1

I can write **secret_room = T.\_\_getitem\_\_** :-) More

lmab

Days Between-lmab 1

You can write diff = date(\*date1) - date(\*date2). See [tutorial](https://docs.python.org/3/tutorial/controlflow.html#unpacking-argument-lists). More

Sim0000

Second-Sim0000 1

In line 6, I can use c.isalnum() instead of c.isalpha() or c.isdigit(). More

Sim0000

with comment-Sim0000 1

By the way, I never thanked @Splitter . Thanks to your appropriate comments, this code was created. More

Sim0000

reduce-Sim0000 1

Important notice! Now we need to use **from math import gcd** More

Sillte

non-sophisticated recursive lambda. -Sillte 1 1

You can write how_deep = lambda s: 1 + max((how_deep(e) for e in s), default=0) if isinstance(s, tuple) else 0 or how_deep = lambda s: 1 + max(map(how_deep, s), default=0) if isinstance(s, tuple) else 0 More

triclosan

First-triclosan 1 1

list(item for item in game_result) is same as game_result. More

shisashi

First-shisashi 1 1

Very simple! By the way, you assign cost, but you do not use cost. More

arma

class Rings() w algo explained-arma 1 1

I try your code. I found a problem your code fail. The correct answer is 3, but your code returns 4. See attached picture. ({1, 2}, {1, 3}, {1, 5}, {2, 3}, {2, 4}, {4, 6}, {5, 6}) More

2 3 4 5 6 7