Family Day update

Task/Prime-decomposition/Python/prime-decomposition-2.py

@@ -8,11 +8,11 @@ def fac(n):
     step = lambda x: 1 + (x<<2) - ((x>>1)<<1)
     maxq = long(floor(sqrt(n)))
     d = 1
-    q = n % 2 == 0 and 2 or 3
+    q = 2 if n % 2 == 0 else 3
     while q <= maxq and n % q != 0:
         q = step(d)
         d += 1
-    return q <= maxq and [q] + fac(n//q) or [n]
+    return [q] + fac(n // q) if q <= maxq else [n]
 
 if __name__ == '__main__':
     import time