CT35150

Parth's Whispering runs

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The harbor bell rings at the silver mines of Lodebarrow; Parth weighs the day's runs manifests and starts the calculations. Task: Print YES if the numbers can be split into two groups with equal sums, otherwise NO. Input format: First line: n. Second line: n positive integers. Output format: Print YES or NO. Constraints: 1 <= n <= 500; 1 <= a[i] <= 100.

Example 1:

Input: 501 74 9 10 83 31 48 99 44 5 93 5 9 54 88 40 88 16 28 71 92 15 51 78 39 65 100 68 68 43 4 56 11 67 42 28 50 44 74 28 80 55 21 47 47 58 31 28 31 80 8 47 81 4 64 63 26 35 81 53 82 85 74 88 88 18 60 45 27 65 27 25 19 64 92 48 46 90 54 11 18 38 8 82 9 29 45 64 53 97 50 23 34 94 93 37 48 68 27 46 66 78 40 66 13 91 97 94 5 45 54 45 58 16 46 45 9 50 2 30 92 29 87 45 33 78 64 69 8 85 95 64 58 65 14 12 12 12 54 26 77 10 47 50 99 63 45 86 31 42 100 77 4 4 45 100 8 68 47 18 69 61 40 86 3 88 13 96 1 64 5 47 60 14 3 67 26 83 26 29 43 48 75 91 16 84 8 95 51 79 43 74 58 38 82 96 36 34 80 13 92 62 64 29 2 57 64 98 91 64 89 67 73 52 37 96 23 63 17 17 81 99 31 65 85 40 51 55 32 92 25 96 21 7 96 58 100 15 32 83 67 65 84 5 58 73 100 5 55 96 68 72 68 13 66 53 27 69 54 98 52 99 52 45 83 84 54 67 26 93 22 60 78 …
Output: YES

Example 2:

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

Example 3:

Input: 501 19 14 36 22 23 91 99 39 45 20 49 90 56 36 1 97 78 86 56 76 74 6 100 16 88 29 16 58 56 80 22 86 76 76 4 4 85 96 88 84 59 48 27 99 18 15 78 28 25 70 72 60 49 62 16 32 13 75 12 48 61 97 25 96 95 7 84 25 27 4 61 23 22 31 91 41 95 66 28 50 88 21 89 47 95 39 44 60 63 66 43 88 83 27 69 98 28 31 11 88 56 12 100 57 92 75 92 90 59 94 95 22 55 12 59 59 88 77 7 96 26 83 87 20 40 49 69 86 65 1 93 42 46 99 60 41 44 45 54 56 67 92 85 70 93 42 8 77 60 29 60 79 29 11 76 71 89 15 54 85 34 38 50 27 67 36 46 50 21 31 91 22 80 29 14 82 91 96 86 29 41 26 61 8 14 51 33 33 66 40 68 77 13 87 53 12 87 42 11 68 35 56 85 51 32 79 79 62 19 31 89 37 44 5 97 90 1 12 65 89 94 93 17 22 54 80 70 83 59 84 94 31 82 38 28 41 73 57 34 24 17 78 3 22 91 35 25 36 55 48 22 86 58 29 55 96 50 97 12 75 67 8 27 72 80 17 14 35 29 5…
Output: YES

Constraints:

1 <= n <= 500; 1 <= a[i] <= 100.

Loading...
Test Cases:No test cases
No test cases available.
Parth's Whispering runs - MEDIUM Coding Problem | CodeTikki