Coder-Strike 2014 - Round 1

Solutions for Coder-Strike 2014 - Round 1 (contest 412). 1/4 problems verified against sample I/O. Difficulty range: 900-2000.

4 items

Coder-Strike 2014 - Round 1

Type: Special | Problems: 4 | Verified: 1/4 | Rating range: 900-2000 | Time: 8m 35s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Poster	900	greedy, implementation	2m 3s	✗
C	Pattern	1200	implementation, strings	2m	✗
D	Giving Awards	2000	dfs-and-similar	1m 55s	✓
E	E-mail Addresses	1900	implementation	2m 37s	✗

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

CF 412A - Poster

We are given a linear banner split into n fixed positions, and a cursor-like ladder that starts at position k. Each position corresponds to exactly one character of a target string, and we must eventually print that string left to right, one character per position.

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

CF 412C - Pattern

Each pattern is a string made of lowercase English letters and the wildcard character ?. A wildcard can represent any lowercase letter. Two patterns intersect if there exists at least one concrete string that matches both of them. For example, a?

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

CF 412D - Giving Awards

We have a directed graph of debts. An edge a - b means employee a owes money to employee b. We must arrange all employees in a sequence such that for every pair of consecutive employees (x, y) in the sequence, there is no edge x - y.

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

CF 412E - E-mail Addresses

We are given a single long string made of lowercase letters, digits, and the characters '.', '', and '@'. We need to consider every contiguous substring and decide whether it can be interpreted as a valid email address under a strict format, then count how many such substrings…