CT38729

The Separate Camps of Saffronia

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The factor Notary has been asked to inspect the delivered goods. On the desk lies a long table of routes readings. 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 <= 1126; 0 <= m <= 2252; 1 <= u,v <= n.

Example 1:

Input: 116 1613 76 88 84 85 9 65 63 94 17 96 10 12 2 46 44 58 4 93 12 91 36 78 73 97 15 54 31 87 85 116 59 72 5 104 29 72 64 97 23 60 54 88 31 43 58 82 27 61 19 112 49 98 39 87 12 29 27 73 38 51 19 32 15 82 3 33 64 71 53 110 7 111 47 51 43 83 6 59 69 116 29 95 11 80 82 84 63 86 10 67 87 90 31 34 29 48 72 101 27 87 6 85 72 109 39 49 58 115 54 96 58 99 11 97 48 62 62 85 16 61 98 107 26 45 78 113 8 24 1 82 30 48 16 73 19 37 46 113 60 78 27 39 68 73 74 105 55 74 35 85 55 72 18 48 58 84 35 81 92 96 20 95 2 62 51 96 15 76 86 114 46 64 72 87 53 77 33 55 37 111 6 53 28 54 22 97 10 13 31 51 32 47 39 100 22 98 45 49 67 73 14 93 72 91 28 92 65 101 41 60 49 78 11 86 28 39 22 26 64 95 1 8 74 98 8 88 3 73 81 90 7 116 55 101 77 113 75 107 26 34 28 68 39 106 42 45 3 28 107 111 40 109 1 39 31 55 64 100 19 105 54 …
Output: 1

Example 2:

Input: 921 1944 207 881 234 275 286 748 107 313 128 364 508 577 480 719 336 809 261 813 747 865 605 875 138 459 172 473 841 879 306 483 612 882 15 302 187 207 689 886 633 911 466 532 463 759 391 418 210 395 62 340 406 686 571 678 367 780 451 487 144 454 337 691 729 764 204 620 501 917 208 256 102 573 226 581 309 520 598 708 546 911 439 778 777 812 768 809 323 642 123 124 98 308 308 733 152 578 278 589 136 716 431 611 175 347 293 882 232 609 316 470 391 774 798 898 246 684 194 632 322 445 856 916 86 275 55 372 242 346 180 369 492 894 33 839 265 844 8 679 549 630 201 333 22 835 140 555 513 684 327 509 317 901 176 618 42 885 205 707 342 623 444 812 404 743 322 881 234 434 382 835 344 378 406 744 508 809 178 455 150 445 440 793 93 472 111 842 77 676 418 567 2 537 765 823 105 824 389 602 160 274 10 40…
Output: 18

Example 3:

Input: 378 1737 174 176 323 330 205 232 136 275 11 236 185 277 214 243 177 204 248 304 319 370 59 200 95 254 30 120 146 250 1 373 93 349 30 184 160 249 10 195 186 303 131 281 125 315 204 307 61 339 258 312 259 337 253 359 33 93 17 146 222 274 99 108 70 113 38 286 15 103 54 267 112 185 69 100 104 118 238 323 130 183 11 44 322 364 219 343 112 130 125 280 147 192 116 227 325 367 183 264 90 241 83 345 55 272 190 195 168 248 168 271 186 308 60 65 135 368 26 103 343 372 16 233 335 357 145 187 137 222 153 233 103 219 30 168 148 376 115 205 27 145 36 352 173 222 252 261 90 271 139 295 55 167 151 162 253 295 28 339 15 126 39 292 279 343 73 143 236 360 179 375 67 100 141 205 166 307 207 335 194 208 67 302 195 243 240 366 128 378 256 319 24 29 70 322 167 293 89 307 54 342 174 193 19 142 114 131 101 273 121 …
Output: 1

Constraints:

1 <= n <= 1126; 0 <= m <= 2252; 1 <= u,v <= n.

Loading...
Test Cases:No test cases
No test cases available.
The Separate Camps of Saffronia - MEDIUM Coding Problem | CodeTikki