Probability in Computer Science · Probabilistic Method: Sum-Free Sets (Optional)
Lesson 4
Programming problem. Given a set \(S \subseteq \{0, 1, \dotsc, 10^{6}\}\) of size \(100\), find its sum-free subset of size \(34\).
The set \(S\) is given in the first (and only) line of the input. Output space separated \(34\) indices (zero-based) of the subset elements in the increasing order.
Public samples
Input
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
Expected output
66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99