fork(3) download
copy 
  1. from operator import itemgetter
  2. import collections
  3.  
  4. tmp = [(0, 30), (0, 20), (10, 40), (30, 50), (50, 90), (70, 100), ]
  5. aa = sorted(tmp, key=itemgetter(1)) # sort with respect to 1st elem
  6. a = set(aa)
  7. space = 100
  8. d_conn = 15
  9. RTT = d_conn*2
  10. bandwidth = 10
  11.  
  12. def get_marginal_cost(fragment):
  13.     return RTT + (fragment[1] - fragment[0])/bandwidth
  14.  
  15. def dfs(a, start, path=None):
  16.     if path is None:
  17.         path = [start, ]
  18.     if start[1] == space:
  19.         yield path
  20.     for frgmt in a - set(path):
  21.         l = frgmt[0]
  22.         r = frgmt[1]
  23.         if start[0] < l <= start[1] <= r:
  24. #        if l <= start[1] <= r:
  25.             yield dfs(a, frgmt, path + [frgmt, ])
  26.  
  27. for z in a:
  28.     if z[0] == 0:
  29.         for output in list(dfs(a, z)):
  30.             for outpu in list(output):
  31.                 for outp in list(outpu):
  32.                     for out in list(outp):
  33.                         for ou in list(out):
  34.                             print list(ou)
Success #stdin #stdout 0.02s 8168KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
[(0, 20), (10, 40), (30, 50), (50, 90), (70, 100)]
[(0, 30), (10, 40), (30, 50), (50, 90), (70, 100)]
[0, 30]
[30, 50]
[50, 90]
[70, 100]
https://ideone.com/oN4jWa
language:
Python (cpython 2.7.16)
created:
11 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!