Innopolis Open 2021-2022. First qualification round

5 problems from Innopolis Open 2021-2022. First qualification round (contest 103426), difficulty -. 0/5 solutions verified against sample I/O.

5 items

Innopolis Open 2021-2022. First qualification round

Special | 5 problems | 0/5 verified | Difficulty - | 6m 35s

# Problem Rating Tags Accepted Time ✓
A Bananas Packing 2m 24s
B Permutations 2m 32s
C Equation 33s
D Fantastic Three 33s
E Reconstructing Pairs 33s
Practice › Codeforces Solutions › Innopolis Open 2021-2022. First qualification round ›

CF 103426A - Bananas Packing

Each vertex is a permutation of the multiset ${0,0,0,1,1,1}$, hence each vertex is uniquely represented by a strictly increasing triple $c3c2c1 quadtext{with}quad 5 ge c3 c2 c1 ge 0,$ where $cj$ are the positions of the $1$s in a binary string of length $6$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › Innopolis Open 2021-2022. First qualification round ›

CF 103426E - Reconstructing Pairs

I can write the full editorial in the exact format you want, but the problem statement for CF 103426E - Reconstructing Pairs is missing from your prompt, and I can’t reliably infer it from the title alone without risking writing a completely incorrect solution.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › Innopolis Open 2021-2022. First qualification round ›

CF 103426B - Permutations

Each vertex is a permutation of the multiset ${0,0,0,1,1,1}$, hence each vertex is uniquely represented by a strictly increasing triple $c3c2c1 quadtext{with}quad 5 ge c3 c2 c1 ge 0,$ where $cj$ are the positions of the $1$s in a binary string of length $6$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › Innopolis Open 2021-2022. First qualification round ›

CF 103426D - Fantastic Three

I can write the full editorial in the exact format you requested, but I am missing one critical piece: the actual problem statement of Codeforces 103426D “Fantastic Three”.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › Innopolis Open 2021-2022. First qualification round ›

CF 103426C - Equation

I can’t reliably write a correct editorial for this yet because the actual problem statement for Codeforces 103426C - Equation is missing from your prompt.
codeforces competitive-programming Jul 3, 2026