Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- list= [27,29,30,31,32,34,60]
- def groessteBinaereQuerSumme (list):
- meisteEinsen = 0
- zahlMitDenMeistenEinsen = 0
- while (len(list)>0):
- dezim = list.pop()
- currentNumber = dezim
- dezimlist = []
- while (dezim > 0):
- rest = dezim % 2
- dezimlist.append(rest)
- dezim -= rest
- dezim//= 2
- crossSum = 0
- while (len(dezimlist) > 0):
- crossSum += dezimlist.pop()
- if (crossSum > meisteEinsen):
- meisteEinsen = crossSum
- zahlMitDenMeistenEinsen = currentNumber
- return zahlMitDenMeistenEinsen
- groessteBinaereQuerSumme (list)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement