April Fools Day Contest 2014

9 problems from April Fools Day Contest 2014 (contest 409), difficulty 1500-2400. 6/9 solutions verified against sample I/O.

9 items

April Fools Day Contest 2014

April Fools | 9 problems | 6/9 verified | Difficulty 1500-2400 | 39m 30s

#	Problem	Rating	Tags	Accepted	Time	✓
A	The Great Game	1700	*special	2,625	4m 21s	✓
B	Mysterious Language	1700	*special	1,429	3m 58s	✓
C	Magnum Opus	1700	*special	2,137	4m 12s	✓
D	Big Data	1700	*special	1,803	4m 2s	✓
E	Dome	1800	*special	618	4m 43s
F	000001	1900	*special	2,173	4m 33s	✓
G	On a plane	2200	*special, geometry	562	4m 44s
H	A + B Strikes Back	1500	*special, brute-force, constructive-algorithms	9,487	4m 14s	✓
I	Feed the Golorp	2400	*special	155	4m 43s

Practice › Codeforces Solutions › April Fools Day Contest 2014 ›

CF 409G - On a plane

We are given a set of $n$ points on a 2D plane with floating-point coordinates. The task is to find the smallest possible angle of rotation around the origin that ensures all points can be covered by a half-plane (a straight line that divides the plane into two parts).

Practice › Codeforces Solutions › April Fools Day Contest 2014 ›

CF 409I - Feed the Golorp

The input is a single string that visually looks like a tiny ASCII “program”. Inside it there are special symbols forming a structure, and within this structure there are placeholder positions that behave like variables.

Practice › Codeforces Solutions › April Fools Day Contest 2014 ›

CF 409H - A + B Strikes Back

The task is to read a single line containing two non-negative integers separated by whitespace and output their arithmetic sum.

Practice › Codeforces Solutions › April Fools Day Contest 2014 ›

CF 409F - 000001

We are given a single integer $a$, and we are asked to compute a certain count associated with binary strings of length $a$. Each position in such a string can be thought of as a switch that is either off or on, but the strings we are allowed to consider are not arbitrary.

Practice › Codeforces Solutions › April Fools Day Contest 2014 ›

CF 409E - Dome

The problem presents a number x that represents a dome's height in some scaled system. Our task is to find two positive integers, a and b, both between 1 and 10 inclusive, that encode this height according to the formula $x = a cdot sqrt{b}$.

Practice › Codeforces Solutions › April Fools Day Contest 2014 ›

CF 409B - Mysterious Language

This is one of Codeforces' April Fools problems. There is no real algorithmic input. The judge provides a special language called "Secret" through the custom invocation system. The task is to identify what that language actually is and submit a program written in that language.

Practice › Codeforces Solutions › April Fools Day Contest 2014 ›

CF 409D - Big Data

At first glance, the problem seems almost absurdly simple: you are given an integer between 1 and 16, and you need to output a single integer corresponding to that input.

Practice › Codeforces Solutions › April Fools Day Contest 2014 ›

CF 409A - The Great Game

We are given two short strings representing sequences of moves in a fictional duel between two teams. Each string is built from a small alphabet that visually looks like emoticon fragments, and each valid move is actually encoded using two characters.

Practice › Codeforces Solutions › April Fools Day Contest 2014 ›

CF 409C - Magnum Opus

The problem gives us a list of integers representing quantities of some alchemical ingredients. The goal is to determine the greatest common divisor (GCD) of these quantities. In other words, we want to find the largest integer $d$ such that each given number is divisible by $d$.