Coder-Strike 2014 - Qualification Round

3 problems from Coder-Strike 2014 - Qualification Round (contest 411), difficulty 800-1700. 3/3 solutions verified against sample I/O.

3 items

Coder-Strike 2014 - Qualification Round

Special | 3 problems | 3/3 verified | Difficulty 800-1700 | 10m 46s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Password Check	800	*special, implementation	8,101	4m 14s	✓
B	Multi-core Processor	1600	implementation	1,398	1m 59s	✓
C	Kicker	1700	*special, implementation	1,293	4m 33s	✓

Practice › Codeforces Solutions › Coder-Strike 2014 - Qualification Round ›

CF 411C - Kicker

We are given four players split into two teams of two. Each player has two independent strengths: one for defending and one for attacking. Before the match, each team assigns one player to attack and the other to defend.

Practice › Codeforces Solutions › Coder-Strike 2014 - Qualification Round ›

CF 411B - Multi-core Processor

We are simulating a processor with several cores and several memory cells. Time is divided into cycles. For every cycle, each core receives either a command to do nothing or a command to write into a specific memory cell. The interesting part is how deadlocks occur.

Practice › Codeforces Solutions › Coder-Strike 2014 - Qualification Round ›

CF 411A - Password Check

We are asked to check whether a password string is "complex enough" based on four criteria. The password is a sequence of up to 100 characters containing uppercase letters, lowercase letters, digits, and a few special characters.