pow/enumerate clear solution for Restricted Prime by makoto_yamagata - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

pow/enumerate solution in Clear category for Restricted Prime by makoto_yamagata

def checkio(n):
    for (i, _) in reversed(list(enumerate('*'*n))):
        if i == True: return True
        if not pow(n, True, i): return False

July 20, 2015

Comments:

han97 on Aug. 23, 2016, 8:35 p.m.
I just realised that, pow(n, True, i) == n % i This is awesome, man :D

han97 on Aug. 23, 2016, 8:37 p.m.
if u write <pre class='brush: python'>if i == True: return True </pre> , shouldn't it work? less condition checking in the loop -> faster

Thenbacker on Oct. 31, 2016, 2:18 p.m.
Excellent short solution, a pleasure to see this!

Magu on Nov. 18, 2021, 1:18 a.m.
<pre class='brush: python'>enumerate('*'*n) </pre> i wanted to use 'enumerate'. but i didn't come up with this manner. excellent. :D

Dropbox

0 %

PyCharm The Python IDE for Professional Developers. Enjoy productive Python, web and scientific development with PyCharm. Download it now!