April Fools Contest 2021 Archive (ZS)

7 problems from April Fools Contest 2021 Archive (ZS) (contest 103034), difficulty -. 0/7 solutions verified against sample I/O.

7 items

April Fools Contest 2021 Archive (ZS)

April Fools | 7 problems | 0/7 verified | Difficulty - | 8m 38s

#	Problem	Time
A	Pacman and Power Pellet	2m 19s
B	As Easy As ABC	2m 7s
C	Two Hashes	31s
D	Math Homework	26s
E	Simple Exercise	2m 25s
F	Mystery	24s
G	Can you do the Hololive?	26s

Practice › Codeforces Solutions › April Fools Contest 2021 Archive (ZS) ›

CF 103034E - Simple Exercise

Let $[n]={1,2,dots,n}$. A simplicial complex $C$ on $[n]$ is an order ideal under inclusion: if $betain C$ and $alphasubseteq beta$, then $alphain C$. For each $t$, let $Nt$ denote the number of $t$-element subsets in $C$.

Practice › Codeforces Solutions › April Fools Contest 2021 Archive (ZS) ›

CF 103034G - Can you do the Hololive?

I can't write a correct editorial for this problem because the prompt does not include the actual problem statement. For Codeforces 103034G - "Can you do the Hololive?

Practice › Codeforces Solutions › April Fools Contest 2021 Archive (ZS) ›

CF 103034A - Pacman and Power Pellet

Let $$Fn(z)=prod{j=0}^{n-1}(1+z+cdots+z^{sj}), qquad left(!binom{S(n)}{k}!right)=[z^k]Fn(z).$$ Then $Fn=F{n-1}(1+z+cdots+z^{s{n-1}})$, so coefficient extraction gives $$left(!binom{S(n)}{k}!right) = sum{r=0}^{s{n-1}}left(!binom{S(n-1)}{k-r}!

Practice › Codeforces Solutions › April Fools Contest 2021 Archive (ZS) ›

CF 103034F - Mystery

I can’t write a correct editorial yet because the actual problem content for Codeforces 103034F - Mystery is missing from your prompt.

Practice › Codeforces Solutions › April Fools Contest 2021 Archive (ZS) ›

CF 103034D - Math Homework

The problem statement is missing from your prompt (the “Problem / Input / Output” sections are empty), so there’s no way to correctly reconstruct Codeforces 103034D - Math Homework without guessing.

Practice › Codeforces Solutions › April Fools Contest 2021 Archive (ZS) ›

CF 103034C - Two Hashes

I can’t write a correct editorial yet because the actual problem statement for Codeforces 103034C - Two Hashes is missing from your prompt. Right now there’s no information about what the input represents, what “two hashes” refers to, or what needs to be computed.

Practice › Codeforces Solutions › April Fools Contest 2021 Archive (ZS) ›

CF 103034B - As Easy As ABC

Let configurations be binary strings $a{n-1}dots a1 a0$ with exactly $t$ ones, with the constraint $a0 = 0$. Let $V(n,t)$ denote this set.