RCC 2014 Warmup (Div. 2)

Solutions for RCC 2014 Warmup (Div. 2) (contest 417). 4/5 problems verified against sample I/O. Difficulty range: 1400-2400.

5 items

RCC 2014 Warmup (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 1400-2400 | Time: 7m 19s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Elimination	1500	dp, implementation, math	1m 39s	✓
B	Crash	1400	implementation	1m 29s	✓
C	Football	1400	constructive-algorithms, graphs, implementation	1m 49s	✓
D	Cunning Gena	1900	bitmasks, dp, greedy	34s	✗
E	Square Table	2400	constructive-algorithms, math, probabilities	1m 48s	✓

Practice › Codeforces Solutions › RCC 2014 Warmup (Div. 2) ›

CF 417A - Elimination

We are organizing a programming competition where the goal is to select at least $n cdot m$ finalists. Participants can qualify in three ways: first, by winning one of the main elimination rounds, which has $c$ problems and produces $n$ winners; second, by winning one of the…

Practice › Codeforces Solutions › RCC 2014 Warmup (Div. 2) ›

CF 417B - Crash

We are given a list of submissions made by participants in a programming contest. Each submission is described by two numbers: x, which counts how many unique solutions this participant had already submitted before this one, and k, the participant's ID.

Practice › Codeforces Solutions › RCC 2014 Warmup (Div. 2) ›

CF 417C - Football

We are asked to construct a complete record of matches between n teams, where every match has a winner and a loser, and no pair of teams plays more than once.

Practice › Codeforces Solutions › RCC 2014 Warmup (Div. 2) ›

CF 417D - Cunning Gena

Gena has a set of problems, and a group of friends who can each solve some subset of them. If Gena hires a friend, that friend will solve all problems they are capable of solving, covering multiple problems at once.

Practice › Codeforces Solutions › RCC 2014 Warmup (Div. 2) ›

CF 417E - Square Table

We are asked to fill an $n times m$ grid with positive integers not exceeding $10^8$. The constraint is not about individual cells but about structure: for every row and every column, if we square all numbers in that line and sum them, the result must itself be a perfect square.