fork download
copy 
  1. def xor_multi(number):
  2.     n = number.split()
  3.     a = "{0:b}".format(int(n[0]))
  4.     b = "{0:b}".format(int(n[1]))
  5.  
  6.     multi = [b if bit != '0' else '0'*len(b) for bit in a]
  7.     for i in range(len(multi)):
  8.         multi[i] += '0'*(len(multi)-i-1)
  9.  
  10.     res = 0
  11.     for x in multi:
  12.        res ^= int(x, 2)
  13.     return '{}@{}={}'.format(n[0], n[1], res)
  14.  
  15. print(xor_multi('1 2'))
  16. print(xor_multi('9 0'))
  17. print(xor_multi('6 1'))
  18. print(xor_multi('3 3'))
  19. print(xor_multi('2 5'))
  20. print(xor_multi('7 9'))
  21. print(xor_multi('13 11'))
  22. print(xor_multi('5 17'))
  23. print(xor_multi('14 13'))
  24. print(xor_multi('19 1'))
  25. print(xor_multi('6 1'))
  26. print(xor_multi('63 63'))
Success #stdin #stdout 0.01s 23304KB
comments ()
stdin
copy 
Standard input is empty
stdout
copy 
1@2=2
9@0=0
6@1=6
3@3=5
2@5=10
7@9=63
13@11=127
5@17=85
14@13=70
19@1=19
6@1=6
63@63=1365
https://ideone.com/vJxBa1
language:
Python (cpython 2.7.16)
created:
7 years ago
visibility:
public

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!