fork(2) download
copy 
  1. import timeit
  2.  
  3.  
  4. def div11(n):
  5.     acc, sign = 0, 1
  6.  
  7.     while n:
  8.         n, r, sign = n // 10, n % 10, -sign
  9.         acc += r * sign
  10.  
  11.     acc = abs(acc)
  12.     return div11(acc) if acc >= 11 else acc == 0
  13.  
  14.  
  15. def is_divisible_by_11(num):
  16.     digits = list(str(num))
  17.     odd = sum(map(int, digits[0::2]))
  18.     even = sum(map(int, digits[1::2]))
  19.     diff = abs(odd - even)
  20.     if diff < 11:
  21.         return diff == 0
  22.     else:
  23.         return is_divisible_by_11(diff)
  24.  
  25. def test1():
  26.     for n in range(1234):
  27.         res = div11(n)
  28.  
  29. def test2():
  30.     for n in range(1234):
  31.         res = is_divisible_by_11(n)
  32.  
  33. print(timeit.timeit(test1, number=1000))
  34. print(timeit.timeit(test2, number=1000))
Success #stdin #stdout 3.2s 9808KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
0.7269691452383995
2.4582832977175713
https://ideone.com/fFcG6n
language:
Python 3 (python  3.12)
created:
4 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!