Croc Champ 2013 - Qualification Round

Solutions for Croc Champ 2013 - Qualification Round (contest 291). 2/2 problems verified against sample I/O. Difficulty range: 1300-2000.

2 items

Croc Champ 2013 - Qualification Round

Type: Special | Problems: 2 | Verified: 2/2 | Rating range: 1300-2000 | Time: 3m 17s

Problem	Name	Rating	Tags	Solve Time	Verified
B	Command Line Arguments	1300	*special, implementation, strings	1m 26s	✓
E	Tree-String Problem	2000	*special, dfs-and-similar, hashing	1m 51s	✓

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

CF 291B - Command Line Arguments

We are given a single string representing a command line in a simplified Pindows operating system. Each "lexeme" in this command line is either a contiguous sequence of non-space characters or a sequence of characters enclosed in double quotes.

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

CF 291E - Tree-String Problem

We have a rooted tree with root 1. Every edge from a parent to a child contains a lowercase string. If we walk downward through the tree and read characters along the edges, we obtain a long text embedded into the tree. A position is not a vertex.