Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def primerjaj(prvi, drugi):
- dolz2 = len(prvi)
- dolz1 = len(drugi)
- sez = [0] * dolz2
- vosta1 = 0
- vosta2 = 0
- stevc = 0
- while (stevc < dolz1) and (stevc < dolz2):
- vosta1 += prvi[stevc]
- vosta2 += drugi[stevc]
- if vosta1 == vosta2:
- sez[stevc] = sez[stevc] + 0
- if vosta1 > vosta2:
- sez[stevc] = sez[stevc] + 1
- if vosta1 < vosta2:
- sez[stevc] = sez[stevc] + 2
- stevc += 1
- return sez
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement