UTPC Contest 01-22-21 Div. 1 (Advanced)

8 problems from UTPC Contest 01-22-21 Div. 1 (Advanced) (contest 102940), difficulty -. 1/8 solutions verified against sample I/O.

8 items

UTPC Contest 01-22-21 Div. 1 (Advanced)

Div. 1 | 8 problems | 1/8 verified | Difficulty - | 6m

# Problem Rating Tags Accepted Time ✓
C Robot Snowman 2m 33s
D Robot Toss 27s
E Decryption Scheme 33s
F Factory Batching 24s
G Ski-Bot 3000 27s
H Factory Tasks 26s
I Artbot 46s ✓
J EvilCorp 24s
Practice › Codeforces Solutions › UTPC Contest 01-22-21 Div. 1 (Advanced) ›

CF 102940C - Robot Snowman

Algorithm H generates all integer partitions $a1 ge cdots ge am ge 1$ of $n$ by maintaining a weakly decreasing sequence whose entries are positive and whose sum is always $n$.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 01-22-21 Div. 1 (Advanced) ›

CF 102940I - Artbot

We are given a tree rooted at node 1, and a robot that performs a constrained walk starting from this root. The robot always starts by visiting node 1 and marking it as painted.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 01-22-21 Div. 1 (Advanced) ›

CF 102940J - EvilCorp

I can absolutely write that editorial in the style you want, but I’m missing the only thing that makes it possible: the actual problem content.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 01-22-21 Div. 1 (Advanced) ›

CF 102940F - Factory Batching

I can’t write a correct Codeforces-style editorial without the actual problem statement. Right now the “Problem Statement / Input / Output” sections are empty, so any solution would be guesswork and would almost certainly be wrong.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 01-22-21 Div. 1 (Advanced) ›

CF 102940H - Factory Tasks

I can absolutely write this editorial, but I’m missing the one thing that makes it possible to be correct: the actual statement of Codeforces 102940H - Factory Tasks.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 01-22-21 Div. 1 (Advanced) ›

CF 102940G - Ski-Bot 3000

The problem statement is empty in what you provided, so there is no way to reconstruct the actual task, constraints, or required algorithm for “Ski-Bot 3000”.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 01-22-21 Div. 1 (Advanced) ›

CF 102940E - Decryption Scheme

I don’t have the actual statement of Codeforces 102940E - Decryption Scheme, and I can’t reliably reconstruct it from the title alone without risking inventing details.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 01-22-21 Div. 1 (Advanced) ›

CF 102940D - Robot Toss

I can write the full Codeforces-style editorial, but I am missing the actual problem statement for Codeforces 102940D - Robot Toss.
codeforces competitive-programming Jul 4, 2026