Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
SSQ
GitHub Repository: SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming
 Path: blob/master/Programming Assignment 4/knapsack1.txt
423 views
1
16808 250

2
50074 659

3
8931 273

4
27545 879

5
77924 710

6
64441 166

7
84493 43

8
7988 504

9
82328 730

10
78841 613

11
44304 170

12
17710 158

13
29561 934

14
93100 279

15
51817 336

16
99098 827

17
13513 268

18
23811 634

19
80980 150

20
36580 822

21
11968 673

22
1394 337

23
25486 746

24
25229 92

25
40195 358

26
35002 154

27
16709 945

28
15669 491

29
88125 197

30
9531 904

31
27723 667

32
28550 25

33
97802 854

34
40978 409

35
8229 934

36
60299 982

37
28636 14

38
23866 815

39
39064 537

40
39426 670

41
24116 95

42
75630 502

43
46518 196

44
30106 405

45
19452 299

46
82189 124

47
99506 883

48
6753 567

49
36717 338

50
54439 145

51
51502 898

52
83872 829

53
11138 359

54
53178 398

55
22295 905

56
21610 232

57
59746 176

58
53636 299

59
98143 400

60
27969 413

61
261 558

62
41595 9

63
16396 969

64
19114 531

65
71007 963

66
97943 366

67
42083 853

68
30768 822

69
85696 713

70
73672 902

71
48591 832

72
14739 58

73
31617 791

74
55641 680

75
37336 7

76
97973 99

77
49096 320

78
83455 224

79
12290 761

80
48906 127

81
36124 507

82
45814 771

83
35239 95

84
96221 845

85
12367 535

86
25227 395

87
41364 739

88
7845 591

89
36551 160

90
8624 948

91
97386 218

92
95273 540

93
99248 386

94
13497 886

95
40624 421

96
28145 969

97
35736 916

98
61626 535

99
46043 12

100
54680 153

101


102