Codeforces Round 626 (Div. 2, based on Moscow Open Olympiad in Informatics)
1 problems from Codeforces Round 626 (Div. 2, based on Moscow Open Olympiad in Informatics) (contest 1323), difficulty 800-800. 1/1 solutions verified against sample I/O.
Codeforces Round 626 (Div. 2, based on Moscow Open Olympiad in Informatics)
Div. 2 | 1 problems | 1/1 verified | Difficulty 800-800 | 3m 48s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Even Subset Sum Problem | 800 | brute-force, dp, greedy | 20,891 | 3m 48s | ✓ |
Practice
›
Codeforces Solutions
›
Codeforces Round 626 (Div. 2, based on Moscow Open Olympiad in Informatics)
›
CF 1323A - Even Subset Sum Problem
We are given several independent arrays of positive integers. For each array, we must select a non-empty group of positions such that the sum of the chosen values is even. If no such group exists, we report failure.