That whitespace is killing me though...
Yet another built-in I learned today!
very powerfull function great job
I really thought my solution would be much faster because I don't use pow at all, I just use a few modulus operations for each subroutine call, but my solution doesn't seem any faster (maybe slower). :)
Whoever implement the pow funtion did an amazing job!!!
maybe it took even longer to write that line :P
Nice Kata, I enjoyed this one. Keep up the great work. Thank you!
Sorry about that @tonylicoding. I was indeed trying to figure it out and look up the performance time. I should have forked or tried on my IDE.
Thanks for the headsup
@ChrisKey13, I viewed your solution and it was the same. I bet you were trying to test it, so use the fork symbol instead to test code. That's because others cheat and copy solutions to get points.
This is as readable a code as you can hope for with such an exercise. Very well done sir
This comment is hidden because it contains spoiler information about the solution
yea maybe, because built-in functions are generally faster
its faster than using x**y % z due to it being a built in function (also more accurate).
to your actual question, i have no idea.
whats the time complexity of this one? i guess mines fast, not sure tho
It seems that pow function has been written in a very cleverly way.
Thanks to the developers and you for showing us the great power of pow function in python!
more test cases please, because you can solve kata without following instructions. Or at least modify this one, so that the set of players each day is the same:
[['AB', 'CD', 'EF', 'GH'], ['AC', 'BD', 'EG', 'FH'], ['AD', 'CE', '', 'B'], ['AE', 'BG', 'CH', 'FD']]
[['AB', 'CD', 'EF', 'GH'], ['AC', 'BD', 'EG', 'FH'], ['ADGF', 'CEH', '', 'B'], ['AE', 'BG', 'CH', 'FD']]