and 4 others joined a min ago.
0
2.8kviews
0
55views
written 6.7 years ago by
teamques10
★ 70k
|
Input: We are given ‘n’ problem that are to be stored on computer tape of length L and the length of program i is Li
Such that 1 ≤i≤ n and Σ 1≤k≤j Li≤ 1
Output: A permutation from all n! For the n programs so that when they …
and 5 others joined a min ago.
ADD COMMENT
EDIT
Please log in to add an answer.