Croc Champ 2013 - Qualification Round

5 problems from Croc Champ 2013 - Qualification Round (contest 291), difficulty 800-2000. 3/5 solutions verified against sample I/O.

5 items

Croc Champ 2013 - Qualification Round

Special | 5 problems | 3/5 verified | Difficulty 800-2000 | 10m 24s

# Problem Rating Tags Accepted Time ✓
A Spyke Talks 800 *special, implementation, sortings 6,475 1m 21s ✓
B Command Line Arguments 1300 *special, implementation, strings 3,086 2m 17s
C Network Mask 1600 *special, bitmasks, brute-force 1,851 2m 14s ✓
D Parallel Programming 1600 *special, greedy 1,539 1m 35s ✓
E Tree-String Problem 2000 *special, dfs-and-similar, hashing 1,576 2m 57s
Practice › Codeforces Solutions › Croc Champ 2013 - Qualification Round ›

CF 291A - Spyke Talks

We are given a list of secretaries and, for each, either a Spyke session number or 0 if the secretary is idle. Each positive session number represents an ongoing call between exactly two people.
codeforces competitive-programming *special implementation sortings Jun 5, 2026
Practice › Codeforces Solutions › Croc Champ 2013 - Qualification Round ›

CF 291C - Network Mask

Each IP address is really a 32-bit integer written in dotted decimal form. A subnet mask is also a 32-bit value, but it must have a very specific shape: some number of leading 1 bits followed by some number of trailing 0 bits.
codeforces competitive-programming *special bitmasks brute-force implementation Jun 5, 2026
Practice › Codeforces Solutions › Croc Champ 2013 - Qualification Round ›

CF 291E - Tree-String Problem

We are given a rooted tree with $n$ vertices, where each edge is labeled with a non-empty string. The root of the tree is vertex 1. Each non-root vertex $v$ has a parent $pv$ and a string $sv$ on the edge from $pv$ to $v$.
codeforces competitive-programming *special dfs-and-similar hashing strings Jun 5, 2026
Practice › Codeforces Solutions › Croc Champ 2013 - Qualification Round ›

CF 291D - Parallel Programming

We are asked to simulate a parallel memory-writing process. There are n processors and n memory cells. Each processor can only write to its corresponding cell, but all processors can read any cell. Initially, all cells except the last one contain 1, and the last cell contains 0.
codeforces competitive-programming *special greedy Jun 5, 2026
Practice › Codeforces Solutions › Croc Champ 2013 - Qualification Round ›

CF 291B - Command Line Arguments

We are given a single command-line string written in the fictional Pindows operating system. A command line consists of lexemes, which are the tokens passed to a program. There are two ways a lexeme can appear. A normal lexeme is a maximal sequence of non-space characters.
codeforces competitive-programming *special implementation strings Jun 5, 2026