NOIP 2023

4 problems from NOIP 2023 (contest 104803), difficulty -. 2/4 solutions verified against sample I/O.

4 items

NOIP 2023

Special | 4 problems | 2/4 verified | Difficulty - | 7m 8s

# Problem Rating Tags Accepted Time ✓
A \u8bcd\u5178 1m 37s
B \u4e09\u503c\u903b\u8f91 1m 42s ✓
C \u53cc\u5e8f\u5217\u6269\u5c55 1m 47s
D \u5929\u5929\u7231\u6253\u5361 2m 2s ✓
Practice › Codeforces Solutions › NOIP 2023 ›

CF 104803D - 天天爱打卡

We are simulating a multi-day training plan where each day a user either runs or rests. Running costs energy, and long streaks are restricted: the user cannot run for more than k consecutive days.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › NOIP 2023 ›

CF 104803C - 双序列扩展

We are given two integer sequences, and each sequence can be “expanded” by replacing every element with a positive number of copies of itself.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › NOIP 2023 ›

CF 104803B - 三值逻辑

We are given a system of variables, each of which can take one of three values: True, False, or Unknown. A sequence of assignment operations is executed in order, and each operation updates a variable either to a constant value, to the value of another variable, or to the…
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › NOIP 2023 ›

CF 104803A - 词典

We are given a collection of $n$ distinct strings, each of the same length $m$. The only operation allowed on a string is to freely permute its characters, since any two positions inside a word can be swapped any number of times.
codeforces competitive-programming Jun 28, 2026