CT34879

The Sterling roads of Odin

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Odin the reckoner watches over the railway depot of Cinderline's stores of roads. A careful computation stands between order and chaos. Task: An undirected graph has n nodes and m edges. Print the number of connected components. Input format: First line: n and m. Next m lines: u v. Output format: Print the component count. Constraints: 1 <= n <= 883; 0 <= m <= 1766; 1 <= u,v <= n.

Example 1:

Input: 40 226 29 30 26 38 6 15 1 10 3 10 10 39 5 11 8 25 4 35 1 11 10 14 24 27 10 20 12 17 9 36 14 31 10 23 12 14 8 28 16 39 9 10 5 30 29 36 3 15 2 35 10 27 11 21 10 29 4 15 5 31 17 21 23 25 21 25 4 31 6 27 3 25 33 40 14 19 7 33 6 22 20 33 27 29 23 24 1 25 3 13 2 10 7 27 22 23 7 12 3 4 22 37 12 35 14 23 25 35 10 37 20 30 17 22 26 37 12 16 1 18 3 29 5 32 21 36 3 36 9 19 14 24 4 8 18 36 8 40 6 35 3 38 1 30 6 32 3 18 29 33 25 26 9 24 21 39 16 26 3 19 2 14 9 26 23 40 18 24 6 31 1 38 6 29 6 38 13 29 15 38 21 35 30 37 24 25 4 11 4 12 8 9 22 38 20 27 7 34 11 14 15 29 13 37 25 37 13 36 11 24 25 28 14 37 2 25 11 34 6 30 5 19 34 36 14 34 15 26 22 29 13 17 13 31 18 20 19 31 25 31 18 27 16 37 15 25 17 32 22 36 16 25 32 40 16 35 29 37 28 30 4 20 8 20 17 24 7 28 4 9 5 39 14 35 5 17 19 25 35 36 6 13 32 34 10 34…
Output: 1

Example 2:

Input: 183 325 102 103 64 98 14 140 39 124 20 22 43 62 89 148 42 137 6 10 37 41 64 138 42 84 45 165 90 143 149 160 114 169 10 71 30 125 46 79 40 84 43 80 73 133 24 58 29 166 30 119 59 62 46 141 83 123 154 180 92 154 4 32 41 132 45 116 82 106 45 122 19 182 10 163 27 118 16 78 145 157 75 127 38 101 57 116 139 140 89 149 28 130 68 126 174 178 29 92 84 102 25 80 61 121 129 183 6 112 85 117 12 18 56 148 16 44 26 29 37 182 15 173 77 172 31 160 100 176 127 164 7 19 103 108 6 61 113 124 9 114 75 133 47 65 21 51 16 24 70 106 148 149 29 168 149 162 57 77 131 136 9 107 32 70 114 122 11 39 119 137 22 127 75 116 50 175 106 183 54 81 38 146 19 22 109 167 50 89 26 90 42 147 37 43 84 91 122 183 50 145 93 146 35 113 100 109 4 102 66 165 56 101 2 94 6 178 83 131 154 173 87 178 116 163 14 170 30 100 106 173 50 181 …
Output: 5

Example 3:

Input: 205 1436 38 133 74 151 51 79 21 138 85 88 69 203 12 14 48 139 33 127 30 133 5 127 47 170 112 113 140 192 64 188 16 170 14 133 154 181 58 171 41 139 37 100 15 167 2 129 83 125 71 107 77 197 124 153 150 155 132 180 25 92 99 103 41 53 171 175 61 65 21 53 47 174 124 163 193 197 58 120 46 180 102 158 110 153 46 115 3 162 9 120 114 155 190 194 37 109 138 156 56 200 16 126 32 56 64 131 118 168 71 190 70 170 104 124 22 35 61 64 153 158 123 135 11 23 9 163 123 140 80 84 142 176 19 28 34 130 81 124 5 100 165 205 101 141 2 48 96 112 46 202 46 50 21 111 195 205 128 152 4 175 89 103 8 191 35 191 96 116 108 164 91 192 72 85 35 186 69 106 8 66 179 182 162 184 20 154 84 123 18 162 31 84 32 54 10 65 22 108 37 87 82 196 103 117 73 109 91 187 160 189 32 57 6 164 143 176 49 180 11 111 108 196 51 196 7 58 83 1…
Output: 1

Constraints:

1 <= n <= 883; 0 <= m <= 1766; 1 <= u,v <= n.

Loading...
Test Cases:No test cases
No test cases available.
The Sterling roads of Odin - MEDIUM Coding Problem | CodeTikki