Croc Champ 2012 - Qualification Round

Solutions for Croc Champ 2012 - Qualification Round (contest 172). 4/5 problems verified against sample I/O. Difficulty range: 800-2200.

5 items

Croc Champ 2012 - Qualification Round

Type: Special | Problems: 5 | Verified: 4/5 | Rating range: 800-2200 | Time: 11m 42s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Phone Code	800	*special, brute-force, implementation	3m	✓
B	Pseudorandom Sequence Period	1200	*special, implementation, number-theory	3m 33s	✓
C	Bus	1500	*special, implementation, sortings	1m 19s	✓
D	Calendar Reform	1500	*special, number-theory	1m 29s	✓
E	BHTML+BCSS	2200	*special, dfs-and-similar, expression-parsing	2m 21s	✗

Practice › Codeforces Solutions › Croc Champ 2012 - Qualification Round ›

CF 172A - Phone Code

We are given a list of phone numbers from friends in a city. Each phone number is a string of digits, and all numbers have the same length. The task is to find the city phone code, which Polycarpus defines as the longest common prefix shared by all these numbers.

Practice › Codeforces Solutions › Croc Champ 2012 - Qualification Round ›

CF 172B - Pseudorandom Sequence Period

We are given a linear congruential generator, a classic pseudorandom sequence formula: $$ri = (a cdot r{i-1} + b) bmod m$$ The sequence starts from r0, and every next value is computed from the previous one.

Practice › Codeforces Solutions › Croc Champ 2012 - Qualification Round ›

CF 172C - Bus

We are asked to simulate the operation of a single bus that repeatedly transports students from a bus stop at coordinate 0 to their respective destinations along the positive axis. Each student arrives at the stop at a distinct time and has a fixed destination coordinate.

Practice › Codeforces Solutions › Croc Champ 2012 - Qualification Round ›

CF 172D - Calendar Reform

Each year in Berland has a certain number of days. The first year has a days, the next has a + 1, and so on for n consecutive years. For a year with x days, the government chooses a month length that satisfies two conditions. First, the month length must be a perfect square.

Practice › Codeforces Solutions › Croc Champ 2012 - Qualification Round ›

CF 172E - BHTML+BCSS

We are given a simplified HTML-like document. Every tag is either an opening tag like <a, a closing tag like </a, or a self-closing tag like <a/. The document is guaranteed to be properly nested, so every opening tag has exactly one matching closing tag.