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

5 problems from Coder-Strike 2014 - Finals (online edition, Div. 1) (contest 420), difficulty 1000-2600. 4/5 solutions verified against sample I/O.

5 items

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

Div. 1 | 5 problems | 4/5 verified | Difficulty 1000-2600 | 8m 34s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Start Up	1000	implementation	7,034	1m 24s	✓
B	Online Meeting	1800	implementation	1,172	2m 4s
C	Bug in Code	1900	data-structures, graphs, implementation	1,394	1m 57s	✓
D	Cup Trick	2200	data-structures	999	1m 9s	✓
E	Playing the ball	2600	geometry	266	2m	✓

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

CF 420A - Start Up

We are asked to determine whether a given company name is symmetric with respect to a vertical mirror. In practical terms, we are given a single string consisting of uppercase English letters, and we need to check whether the string would appear identical if reflected in a…

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

CF 420B - Online Meeting

We have a meeting log for a team of developers where each log entry records either a user logging in or logging out. The log may start or end in the middle of the meeting, so we do not know who was online before the first recorded message.

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

CF 420C - Bug in Code

Each participant in the company meeting points to two other people and claims that the culprit is one of those two. From this we can think of the input as an array of length $n$, where each index $i$ stores an unordered pair $(xi, yi)$.

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

CF 420D - Cup Trick

We are given a line of cups, each cup carrying a unique label from 1 to n. The initial left-to-right order of these labels is unknown. What we do know is the exact sequence of m operations performed on this line.

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

CF 420E - Playing the ball

A ball is thrown from the origin along some chosen direction, and it repeatedly appears at equally spaced points along that ray: first at distance $d$, then at $2d$, then $3d$, and so on. The direction is fixed once chosen, but it can be any real direction in the plane.