Coder-Strike 2014 - Round 2

Solutions for Coder-Strike 2014 - Round 2 (contest 413). 4/5 problems verified against sample I/O. Difficulty range: 1200-2200.

5 items

Coder-Strike 2014 - Round 2

Type: Special | Problems: 5 | Verified: 4/5 | Rating range: 1200-2200 | Time: 9m 37s

Problem Name Rating Tags Solve Time Verified
A Data Recovery 1200 implementation 1m 42s ✓
B Spyke Chatting 1300 implementation 1m 48s ✗
C Jeopardy! 1400 greedy, math 2m 23s ✓
D 2048 2000 bitmasks, dp 2m 23s ✓
E Maze 2D 2200 data-structures, divide-and-conquer 1m 21s ✓
Practice › Codeforces Solutions › Coder-Strike 2014 - Round 2 ›

CF 413A - Data Recovery

The problem gives us a sequence of processor temperatures recorded over n steps. The chief engineer has reliable notes of the minimum and maximum temperature observed, but the assistant only recorded m of the n temperatures.
codeforces competitive-programming implementation May 29, 2026
Practice › Codeforces Solutions › Coder-Strike 2014 - Round 2 ›

CF 413B - Spyke Chatting

We are given a company where employees participate in several independent chat groups. Each chat has a fixed membership defined in advance. Over time, a log records messages: each event says that a particular employee posts in a particular chat.
codeforces competitive-programming implementation May 29, 2026
Practice › Codeforces Solutions › Coder-Strike 2014 - Round 2 ›

CF 413C - Jeopardy!

The game consists of n questions, each with some base value a[i]. Some questions are marked as auctions. Team R2 starts by choosing the first question. After that, whoever answered the previous question correctly gets to choose the next question.
codeforces competitive-programming greedy math May 29, 2026
Practice › Codeforces Solutions › Coder-Strike 2014 - Round 2 ›

CF 413D - 2048

We process a sequence of tiles, each tile being either 2 or 4. A tile starts far to the right and slides left. When it touches an equal value, the two merge into a doubled value and the new tile keeps moving.
codeforces competitive-programming bitmasks dp May 29, 2026
Practice › Codeforces Solutions › Coder-Strike 2014 - Round 2 ›

CF 413E - Maze 2D

We are working on a very narrow grid: only two rows, but a large number of columns. Each cell in this 2 by n strip is either free or blocked.
codeforces competitive-programming data-structures divide-and-conquer May 29, 2026