We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent db38f0e commit 0de43acCopy full SHA for 0de43ac
dynamic_programming/brige_torch_problem.py
@@ -1,5 +1,4 @@
1
-#person_pace = [1, 2, 5, 10,12,16]
2
-person_pace = list(map(int, input().split()))
+person_pace = [1, 2, 5, 10,12,16]
3
person_pace.sort() # Sort the array for optimal pairing
4
people = len(person_pace)
5
0 commit comments