JCPC 2022

11 problems from JCPC 2022 (contest 104147), difficulty -. 2/11 solutions verified against sample I/O.

11 items

JCPC 2022

Special | 11 problems | 2/11 verified | Difficulty - | 8m 24s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Round 1				29s
B	I'll call him Hanya				30s
C	Disney Land				35s
D	Do and Tak Game				32s
E	I am not done yet				30s
F	Nesr El Sieve				31s
G	You're Milky				48s	✓
H	Alexandria Library				29s
I	Wigz				1m 17s
J	Two Faced Hobz				1m 28s
K	Hobz is a good guy				1m 15s	✓

Practice › Codeforces Solutions › JCPC 2022 ›

CF 104147K - Hobz is a good guy

We are given a binary string and we are allowed to delete any number of characters from it, possibly all but at least one character must remain.

Practice › Codeforces Solutions › JCPC 2022 ›

CF 104147J - Two Faced Hobz

Each test case gives a collection of $N$ independent pairs. From the $i$-th pair you must choose exactly one value, either $Ai$ or $Bi$. After all choices are made, all selected values are XORed together to produce a single number, called the Salkan.

Practice › Codeforces Solutions › JCPC 2022 ›

CF 104147I - Wigz

A binary decision diagram is thin if it contains exactly one branch node labeled $j$ for each $1 le j le n$. Denote by $Sn$ the number of Boolean functions on $(x1,dots,xn)$ whose reduced ordered BDD is thin. Let $vj$ denote the unique node labeled $j$.

Practice › Codeforces Solutions › JCPC 2022 ›

CF 104147G - You're Milky

We are simulating a process where a person receives multiple deliveries of milk over time. Each delivery arrives on a specific day with a given quantity. Milk is not permanent: every batch has a fixed freshness window, after which it becomes unusable and must be discarded.

Practice › Codeforces Solutions › JCPC 2022 ›

CF 104147H - Alexandria Library

The problem statement section is empty, so there’s no way to reconstruct the actual task reliably. For a Codeforces editorial, the difference between a graph problem, a data structure problem, or a combinatorics problem completely changes the approach, so guessing would…

Practice › Codeforces Solutions › JCPC 2022 ›

CF 104147F - Nesr El Sieve

I don’t have the actual problem statement for Codeforces 104147F - Nesr El Sieve, so I can’t safely reconstruct the solution or write a correct editorial yet.

Practice › Codeforces Solutions › JCPC 2022 ›

CF 104147D - Do and Tak Game

I can’t reliably write a correct editorial for “Codeforces 104147D - Do and Tak Game” because the problem statement is missing from your prompt, and I don’t have enough information to reconstruct the rules, constraints, or required output.

Practice › Codeforces Solutions › JCPC 2022 ›

CF 104147E - I am not done yet

I don’t have the actual statement for Codeforces 104147E - I am not done yet in your prompt, so I can’t reconstruct the problem, constraints, or intended solution without risking inventing details.

Practice › Codeforces Solutions › JCPC 2022 ›

CF 104147C - Disney Land

I don’t have the actual statement of Codeforces 104147C - Disney Land in the prompt, and I can’t reliably reconstruct it from the title alone without risking inventing details.

Practice › Codeforces Solutions › JCPC 2022 ›

CF 104147A - Round 1

I can write the full editorial in the format you want, but I’m missing the actual problem statement for Codeforces 104147A - Round 1.

Practice › Codeforces Solutions › JCPC 2022 ›

CF 104147B - I'll call him Hanya

I can’t reliably write a correct editorial without the actual problem statement for Codeforces 104147B (“I’ll call him Hanya”).