The 2022 ICPC Asia Nanjing Regional Contest

13 problems from The 2022 ICPC Asia Nanjing Regional Contest (contest 104128), difficulty -. 0/13 solutions verified against sample I/O.

13 items

The 2022 ICPC Asia Nanjing Regional Contest

ICPC/IOI | 13 problems | 0/13 verified | Difficulty - | 9m 8s

# Problem Rating Tags Accepted Time ✓
A Stop, Yesterday Please No More 2m 2s
B Ropeway 31s
C Fabulous Fungus Frenzy 27s
D Chat Program 29s
E Color the Tree 29s
F Triangles 28s
G Inscryption 27s
H Factories Once More 30s
I Perfect Palindrome 27s
J Perfect Matching 27s
K NaN in a Heap 1m 55s
L Proposition Composition 27s
M Drain the Water Tank 29s
Practice › Codeforces Solutions › The 2022 ICPC Asia Nanjing Regional Contest ›

CF 104128K - NaN in a Heap

Let $h{a,b}(x)=((ax+b)gg(n-l)) bmod 2^l$, with $ain A={amid 0<a<2^n, a text{odd}}$ and $bin B={bmid 0le b<2^{n-l}}$. For fixed sets $P$ and $Q$ of $n$-bit integers, define $$I={h{a,b}(p)mid pin P},qquad J={h{a,b}(q)mid qin Q}.$$ Let $ $$Pr[h{a,b}(x)=h{a,b}(y)]le 2^{-l}.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 2022 ICPC Asia Nanjing Regional Contest ›

CF 104128M - Drain the Water Tank

The problem statement is missing from your message, so there’s no way to reliably reconstruct the model, constraints, or required algorithm.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 2022 ICPC Asia Nanjing Regional Contest ›

CF 104128L - Proposition Composition

I can’t reliably write a correct editorial for “Codeforces 104128L - Proposition Composition” without the actual problem statement.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 2022 ICPC Asia Nanjing Regional Contest ›

CF 104128J - Perfect Matching

I can write the full editorial in the exact style you requested, but I’m missing the only thing needed to make it correct: the actual problem statement for Codeforces 104128J - Perfect Matching.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 2022 ICPC Asia Nanjing Regional Contest ›

CF 104128I - Perfect Palindrome

I can’t write a correct editorial for “Codeforces 104128I - Perfect Palindrome” as-is because the actual problem statement is missing from your prompt. Right now I don’t know: - what the input structure is (string, array, multiple test cases, etc.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 2022 ICPC Asia Nanjing Regional Contest ›

CF 104128A - Stop, Yesterday Please No More

Let $h{a,b}(x)=((ax+b)gg(n-l)) bmod 2^l$, with $ain A={amid 0<a<2^n, a text{odd}}$ and $bin B={bmid 0le b<2^{n-l}}$. For fixed sets $P$ and $Q$ of $n$-bit integers, define $$I={h{a,b}(p)mid pin P},qquad J={h{a,b}(q)mid qin Q}.$$ Let $ $$Pr[h{a,b}(x)=h{a,b}(y)]le 2^{-l}.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 2022 ICPC Asia Nanjing Regional Contest ›

CF 104128H - Factories Once More

I can’t write a correct editorial for “Codeforces 104128H - Factories Once More” because the problem statement is missing from your prompt. Right now there’s no information about: - what the “factories” are in the model (graph, array, tree, etc.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 2022 ICPC Asia Nanjing Regional Contest ›

CF 104128G - Inscryption

I can’t reliably write a correct editorial for Codeforces 104128G - Inscryption from just the title. The full solution depends entirely on the actual rules (game mechanics, operations allowed, constraints, and what is being optimized or decided).
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 2022 ICPC Asia Nanjing Regional Contest ›

CF 104128F - Triangles

The problem statement for “Codeforces 104128F - Triangles” is not included in your message, so I don’t have the actual definitions of the input, output, or the task the solution is supposed to solve.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 2022 ICPC Asia Nanjing Regional Contest ›

CF 104128E - Color the Tree

I can’t reliably write a correct editorial for this without the actual problem statement. “Codeforces 104128E - Color the Tree” isn’t identifiable from the title alone, and guessing would very likely produce the wrong model, wrong constraints, and therefore a misleading…
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 2022 ICPC Asia Nanjing Regional Contest ›

CF 104128D - Chat Program

I can’t write a correct editorial yet because the actual problem statement for “Codeforces 104128D - Chat Program” is missing from your prompt.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 2022 ICPC Asia Nanjing Regional Contest ›

CF 104128C - Fabulous Fungus Frenzy

I can’t reliably write a correct Codeforces editorial for “104128C - Fabulous Fungus Frenzy” because the actual problem statement, input format, and constraints are missing from your prompt.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 2022 ICPC Asia Nanjing Regional Contest ›

CF 104128B - Ropeway

I’m missing the actual problem statement for Codeforces 104128B - Ropeway, and without it I can’t produce a correct editorial.
codeforces competitive-programming Jul 2, 2026