CT56491

Varun's canals Reckoning

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

In the silver mines of Lodebarrow, Varun the log keeper keeps careful count of the canals. assign crews to the morning shifts, every figure matters. 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 <= 1090; 0 <= m <= 2180; 1 <= u,v <= n.

Example 1:

Input: 106 995 57 100 61 104 35 53 45 100 55 88 74 86 58 59 31 103 34 68 55 75 29 55 79 99 41 87 24 60 34 54 12 39 5 87 29 92 24 78 14 97 12 34 95 104 2 73 29 31 14 36 58 76 43 57 33 88 71 90 3 45 79 83 31 104 5 60 74 104 13 106 46 99 10 32 61 106 20 49 30 32 76 86 7 31 29 60 11 68 37 72 22 104 30 88 86 102 34 72 37 69 69 80 52 72 42 64 5 16 52 75 13 70 22 89 43 85 18 26 21 57 12 16 59 85 17 70 28 84 72 100 35 72 14 47 19 42 14 26 101 105 87 94 34 102 41 64 78 102 78 87 35 105 49 94 52 105 78 94 9 11 44 86 35 96 10 29 47 50 19 86 80 87 24 93 33 48 6 38 1 49 77 102 8 83 16 22 58 78 37 49 94 97 43 98 27 90 26 27 33 86 67 95 8 33 1 75 27 65 77 90 10 81 69 89 60 102 2 41 23 36 26 87 34 57 31 67 66 101 55 90 11 30 3 49 21 50 49 104 65 80 35 74 41 79 1 55 67 69 25 80 78 95 8 88 40 57 19 32 6 69 65 68 4…
Output: 1

Example 2:

Input: 841 788 199 720 238 463 457 529 187 371 496 660 515 637 522 759 228 839 434 469 250 404 250 717 314 832 251 813 81 554 4 394 64 493 510 698 155 688 658 800 467 746 359 462 175 429 269 826 158 741 66 257 136 545 366 686 217 531 44 653 497 816 538 591 161 641 198 685 304 372 215 387 17 132 43 427 602 649 231 291 51 558 279 467 186 445 384 530 71 800 458 470 269 426 40 50 94 583 101 298 276 472 515 710 346 362 52 176 7 188 110 356 87 671 103 534 45 704 41 571 6 339 417 444 42 316 255 705 158 370 208 506 147 815 59 235 38 74 228 810 134 507 16 553 474 586 147 199 407 563 361 454 641 671 223 833 87 246 41 97 423 616 406 678 295 575 390 448 659 797 186 301 63 299 244 276 486 798 93 110 432 462 41 432 1 200 747 809 226 507 39 80 662 795 432 827 336 344 430 774 163 448 112 626 35 744 199 238 298 4…
Output: 166

Example 3:

Input: 71 1010 29 47 24 47 3 68 51 68 6 8 14 68 33 52 5 62 20 57 44 65 2 8 12 38 10 14 2 11 7 19 60 63 8 20 42 69 37 53 21 42 53 65 24 29 36 47 31 70 14 46 32 49 7 64 42 62 55 71 12 60 36 56 35 62 18 30 33 65 33 64 9 63 33 67 34 37 14 57 10 49 38 63 52 57 34 40 9 69 40 69 11 56 16 21 45 66 25 66 12 24 16 69 11 37 27 70 2 40 21 68 13 60 4 13 25 38 44 68 10 31 12 22 29 53 22 54 47 51 17 46 15 63 51 61 21 64 14 60 4 33 58 69 7 34 44 52 14 18 6 33 7 40 17 68 40 70 6 18 21 61 16 37 6 39 32 48 18 47 34 48 9 42 28 35 58 71 46 58 8 25 48 58 8 48 40 59 12 66 48 53 21 60 7 12 29 33 2 43 29 67 14 50 36 46 38 50 11 31 32 53 10 60 40 61 39 58 32 36 2 45 27 48 44 58 33 54 2 58 4 51 43 58 26 44 30 32 28 52 46 68 8 71 8 12 2 54 37 71 61 62 12 21 8 64 37 68 30 58 38 70 6 19 38 61 16 56 52 54 25 58 37 44 20 54 4 5…
Output: 1

Constraints:

1 <= n <= 1090; 0 <= m <= 2180; 1 <= u,v <= n.

Loading...
Test Cases:No test cases
No test cases available.
Varun's canals Reckoning - MEDIUM Coding Problem | CodeTikki