Coder-Strike 2014 - Finals (online edition, Div. 2)

Solutions for Coder-Strike 2014 - Finals (online edition, Div. 2) (contest 421). 2/2 problems verified against sample I/O. Difficulty range: 800-1900.

2 items

Coder-Strike 2014 - Finals (online edition, Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 800-1900 | Time: 2m 37s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Pasha and Hamsters	800	constructive-algorithms, implementation	1m	✓
D	Bug in Code	1900	binary-search, data-structures, sortings	1m 37s	✓

Practice › Codeforces Solutions › Coder-Strike 2014 - Finals (online edition, Div. 2) ›

CF 421A - Pasha and Hamsters

We are given a line of apples numbered from 1 to n. Each apple can be given to exactly one of two hamsters, Arthur or Alexander. The only restriction is that Arthur must receive only apples he likes, and Alexander must receive only apples he likes.

Practice › Codeforces Solutions › Coder-Strike 2014 - Finals (online edition, Div. 2) ›

CF 421D - Bug in Code

We are given a network of coders, and each coder makes a claim during a meeting: they point to two other coders and assert that the culprit is one of those two people. We then have to choose exactly two coders to bring in as suspects.