April Fools Day Contest 2013

Solutions for April Fools Day Contest 2013 (contest 290). 3/4 problems verified against sample I/O. Difficulty range: 1400-2800.

4 items

April Fools Day Contest 2013

Type: April Fools | Problems: 4 | Verified: 3/4 | Rating range: 1400-2800 | Time: 6m 44s

Problem	Name	Rating	Tags	Solve Time	Verified
C	WTF?	1700	*special, graph-matchings, implementation	1m 31s	✓
D	Orange	1400	*special, implementation	2m 11s	✗
E	HQ	2500	*special, constructive-algorithms	1m 43s	✓
F	Greedy Petya	2800	*special, dfs-and-similar, graphs	1m 19s	✓

Practice › Codeforces Solutions › April Fools Day Contest 2013 ›

CF 290C - WTF?

The statement is written as a LOLCODE program. The actual task is to understand what this program computes. The input is a sequence of digits between 0 and 9, one per line. The program repeatedly reads numbers until it encounters 0.

Practice › Codeforces Solutions › April Fools Day Contest 2013 ›

CF 290D - Orange

We are given a string consisting of uppercase and lowercase English letters, and an integer k. The task is to modify the string so that exactly k characters become uppercase. The relative order of characters must stay unchanged, only the letter cases may change.

Practice › Codeforces Solutions › April Fools Day Contest 2013 ›

CF 290E - HQ

The original HQ9+ language has several commands with special behavior. This problem asks about a reduced version called HQ..., and the destroyed statement leaves only enough clues to reconstruct the intended task. We are given a single string representing a program.

Practice › Codeforces Solutions › April Fools Day Contest 2013 ›

CF 290F - Greedy Petya

The statement is intentionally misleading. We are not asked to solve the Hamiltonian path problem ourselves. Instead, we must reproduce the output of Petya’s supposedly correct program. That changes the task completely.