CT32765

The Shelf Position of the Copper vials

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

The ledger master Librarian has been asked to document the rare sighting. On the desk lies a long table of vials readings. Task: The array is sorted in non-decreasing order. Print the 1-based index of the first occurrence of x, or -1 if x is absent. Input format: First line: n and x. Second line: n sorted integers. Output format: Print the 1-based index or -1. Constraints: 1 <= n <= 7708; 0 <= a[i],x <= 1000.

Example 1:

Input: 1353 896 1 1 2 2 3 3 3 4 4 4 8 8 8 9 9 9 10 11 12 12 12 12 13 13 13 13 13 15 16 16 18 19 19 19 19 20 21 22 22 23 24 25 25 26 26 27 28 28 29 31 31 31 32 32 32 33 33 34 34 36 37 38 38 39 40 41 41 44 44 45 46 46 46 46 46 47 48 49 49 50 50 50 50 50 51 51 52 52 53 54 54 54 55 58 58 58 59 60 60 61 61 62 62 63 63 63 65 65 66 67 67 68 68 69 70 70 70 72 73 74 74 76 79 80 80 81 83 84 84 85 85 86 88 88 88 88 89 90 93 93 93 94 94 95 95 99 101 101 103 103 103 104 104 104 105 106 107 108 111 111 112 113 113 114 116 117 118 118 118 119 119 119 119 120 120 121 121 122 122 122 122 124 124 125 127 128 129 129 130 131 131 132 132 132 133 133 134 134 134 135 135 136 136 137 137 137 137 137 140 141 142 143 145 145 148 150 154 154 156 157 157 157 158 158 158 158 158 159 159 161 161 161 162 162 162 166 168 169 1…
Output: 1199

Example 2:

Input: 1683 573 2 3 3 3 4 5 5 6 6 6 7 7 8 9 9 11 11 12 13 14 15 16 16 16 17 18 19 19 20 20 21 22 22 22 22 22 24 24 26 26 28 28 29 30 30 32 33 33 34 34 34 35 37 37 37 37 38 39 40 40 40 40 40 40 40 40 41 41 41 41 42 42 42 44 45 45 46 46 46 46 47 47 48 49 50 51 51 51 51 52 53 54 55 55 56 56 56 57 58 59 59 60 61 61 62 63 63 63 64 65 66 67 67 68 68 69 69 70 70 72 73 73 73 73 73 74 74 75 75 77 77 78 78 79 79 82 83 83 83 84 84 84 85 86 86 87 88 89 90 90 90 90 91 91 91 92 94 95 95 95 96 96 97 97 97 97 98 98 98 98 99 100 102 103 104 104 105 106 107 107 107 108 109 109 109 110 110 110 111 111 112 112 112 112 113 113 114 114 114 115 115 117 117 117 118 118 118 119 120 121 121 122 123 125 125 125 127 127 127 129 130 131 132 133 133 134 134 135 135 135 135 136 136 138 138 139 139 140 140 140 140 141 141 143 1…
Output: 956

Example 3:

Input: 3879 352 0 0 0 0 0 0 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 3 3 3 3 4 4 5 5 5 5 5 5 6 6 6 6 6 6 7 7 7 7 7 7 7 8 8 8 9 9 9 10 10 10 10 11 11 11 11 11 11 12 12 12 12 13 13 13 13 13 13 14 15 15 15 16 16 17 17 17 18 18 18 18 18 18 18 19 19 19 19 19 19 19 19 19 19 19 20 20 20 20 20 21 21 21 21 22 22 22 23 23 23 23 24 24 24 24 24 25 25 25 25 25 25 25 26 26 26 26 26 27 27 27 27 27 27 27 28 28 28 28 28 28 29 29 29 29 29 29 29 29 29 30 30 30 30 30 31 31 32 32 32 33 33 33 33 34 34 34 34 35 35 35 35 36 36 36 36 36 37 37 38 38 38 38 38 38 39 39 39 39 40 40 40 40 41 41 41 41 42 42 42 42 43 43 44 44 44 44 44 44 44 45 45 45 45 46 46 47 47 47 47 47 47 48 48 48 48 49 49 49 50 50 50 51 51 51 51 51 51 51 52 52 52 53 53 53 54 54 54 54 54 54 54 54 55 55 55 56 56 56 56 56 57 57 57 57 57 58 58 58 59 59 59 59 60 61 61 6…
Output: 1418

Constraints:

1 <= n <= 7708; 0 <= a[i],x <= 1000.

Loading...
Test Cases:No test cases
No test cases available.
The Shelf Position of the Copper vials - MEDIUM Coding Problem | CodeTikki