fork(2) download
copy 
  1. N=30951344
  2. L=201310
  3. U=3567891
  4.  
  5. n_bits = len(bin(N)[2:])
  6. n_mask = (1 << n_bits) - 1
  7. n_mask ^= N
  8. M = L
  9. if L < n_mask < U:
  10. 	M = n_mask
  11. else:
  12. 	for i in range(L+1, U):
  13. 		M = (n_mask & i) if (n_mask & i) > M else M
  14.  
  15. print "L  %-15d %32s" % (L, bin(L)[2:])
  16. print "M  %-15d %32s" % (M, bin(M)[2:])
  17. print "U  %-15d %32s" % (U, bin(U)[2:])
  18. print "N  %-15d %32s" % (N, bin(N)[2:])
  19. print "NM %-15d %32s" % (N|M, bin(N|M)[2:])
  20.  
  21.  
Success #stdin #stdout 0.01s 7852KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
L  201310                        110001001001011110
M  2603087                   1001111011100001001111
U  3567891                   1101100111000100010011
N  30951344               1110110000100011110110000
NM 33554431               1111111111111111111111111
https://ideone.com/VhssDq
language:
Python (cpython 2.7.16)
created:
12 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!