Codeforces Round 178 (Div. 2)

Solutions for Codeforces Round 178 (Div. 2) (contest 294). 3/4 problems verified against sample I/O. Difficulty range: 800-2500.

4 items

Codeforces Round 178 (Div. 2)

Type: Div. 2 | Problems: 4 | Verified: 3/4 | Rating range: 800-2500 | Time: 6m 7s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Shaass and Oskols	800	implementation, math	1m 38s	✓
C	Shaass and Lights	1900	combinatorics, number-theory	1m 10s	✓
D	Shaass and Painter Robot	2500	brute-force, implementation, number-theory	1m 47s	✗
E	Shaass the Great	2300	dp, trees	1m 32s	✓

Practice › Codeforces Solutions › Codeforces Round 178 (Div. 2) ›

CF 294A - Shaass and Oskols

We have several wires stacked vertically. Each wire contains some birds sitting in a row from left to right. Every shot targets exactly one bird on one wire. When a bird on wire x is shot at position y, three things happen immediately: 1. The bird itself disappears. 2.

Practice › Codeforces Solutions › Codeforces Round 178 (Div. 2) ›

CF 294C - Shaass and Lights

We are given a row of n lights, some of which are initially on. Each light can only be turned on if it has at least one neighbor that is already on. The task is to count how many sequences of switches exist that will eventually turn all the lights on.

Practice › Codeforces Solutions › Codeforces Round 178 (Div. 2) ›

CF 294D - Shaass and Painter Robot

We are asked to simulate a painter robot moving diagonally across a rectangular floor made of tiles. Each tile starts white, and the robot paints a tile black whenever it enters it. The robot can face one of four diagonal directions: up-left, up-right, down-left, or down-right.

Practice › Codeforces Solutions › Codeforces Round 178 (Div. 2) ›

CF 294E - Shaass the Great

We are given a tree with $n$ cities connected by $n-1$ roads. Each road has a positive length. The tree structure guarantees a unique path between every pair of cities.