Advertisement
MagicWinnie

Untitled

Nov 22nd, 2019
201
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.69 KB | None | 0 0
  1. intervals = eval(input())
  2. count=intervals[0][0]
  3. minimum = 13829732984
  4. for i in intervals[:-1]:
  5.     if sum(i)<minimum:
  6.         minimum = sum(i)
  7. arr = []
  8. first_min = min(intervals, key = lambda t: t[0])[0]
  9. for i in range(1, minimum+1):
  10.     d=i
  11.     for j in range(0, len(intervals)-1):
  12.         m=count - d*(j+1)
  13.         while m>intervals[j+1][0]+intervals[j+1][1]:
  14.             m-=intervals[j+1][0]+intervals[j+1][1]
  15.  
  16.         if m<intervals[j+1][0] and m>=0:
  17.             count+=(intervals[j+1][0]-m)
  18.         else:
  19.             if abs(m)>intervals[j+1][1]:
  20.                 count+=intervals[j+1][0]-abs(m)
  21.     arr.append(count)
  22.     count=intervals[0][0]
  23.    
  24. print(max(arr)/len(intervals))
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement