SDU Open 2021 Fall

10 problems from SDU Open 2021 Fall (contest 103351), difficulty -. 1/10 solutions verified against sample I/O.

10 items

SDU Open 2021 Fall

Special | 10 problems | 1/10 verified | Difficulty - | 11m 5s

# Problem Rating Tags Accepted Time ✓
A Modulo Sequence 2m 35s
B A+B 52s ✓
C Simplux 35s
D Set game 31s
E The Best Present 29s
F Nomadic Life 2m 13s
G Digit analysis 30s
H Median 43s
I Guess the expression 2m 11s
J Maximal perfectionism 26s
Practice › Codeforces Solutions › SDU Open 2021 Fall ›

CF 103351F - Nomadic Life

Let $n ct cdots c1 ge 0$ with the constraints from exercise 57 and the additional condition $c{j+1} cj + 1 qquad (t j ge 1).$ Define the shifted variables $dj = cj - (j-1), qquad 1 le j le t.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › SDU Open 2021 Fall ›

CF 103351I - Guess the expression

Let $n ct cdots c1 ge 0$ with the constraints from exercise 57 and the additional condition $c{j+1} cj + 1 qquad (t j ge 1).$ Define the shifted variables $dj = cj - (j-1), qquad 1 le j le t.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › SDU Open 2021 Fall ›

CF 103351J - Maximal perfectionism

I’m missing the actual problem content for Codeforces 103351J - Maximal perfectionism (the statement, input/output definition, and constraints).
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › SDU Open 2021 Fall ›

CF 103351H - Median

I can’t reliably write a correct editorial yet because the full statement of Codeforces 103351H is not included in your prompt, and the problem page does not provide enough accessible detail in isolation.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › SDU Open 2021 Fall ›

CF 103351A - Modulo Sequence

Let $n ct cdots c1 ge 0$ with the constraints from exercise 57 and the additional condition $c{j+1} cj + 1 qquad (t j ge 1).$ Define the shifted variables $dj = cj - (j-1), qquad 1 le j le t.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › SDU Open 2021 Fall ›

CF 103351G - Digit analysis

I can write the full editorial, but I’m missing the actual problem statement for Codeforces 103351G - Digit analysis.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › SDU Open 2021 Fall ›

CF 103351E - The Best Present

I can’t write a correct editorial for “Codeforces 103351E - The Best Present” because the actual problem statement is missing from your prompt. Right now there’s no information about what the input represents, what needs to be computed, or any constraints.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › SDU Open 2021 Fall ›

CF 103351D - Set game

I’m missing the actual problem statement for Codeforces 103351D - Set game, and I can’t reliably reconstruct it from the title alone without risking inventing details.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › SDU Open 2021 Fall ›

CF 103351B - A+B

The task is the classic arithmetic building block: we are given integer pairs, and for each pair we must output their sum. Each input line represents two numbers that should be combined directly, with no additional structure such as graphs or arrays.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › SDU Open 2021 Fall ›

CF 103351C - Simplux

I can’t produce a correct, problem-specific editorial yet because the actual statement of Codeforces 103351C - Simplux is missing from your prompt. Without the rules, input format, and constraints, any solution would be guesswork and very likely wrong.
codeforces competitive-programming Jul 3, 2026