Codeforces Beta Round 87 (Div. 2 Only)

Solutions for Codeforces Beta Round 87 (Div. 2 Only) (contest 116). 2/2 problems verified against sample I/O. Difficulty range: 800-1100.

2 items

Codeforces Beta Round 87 (Div. 2 Only)

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

Problem	Name	Rating	Tags	Solve Time	Verified
A	Tram	800	implementation	1m 33s	✓
B	Little Pigs and Wolves	1100	greedy, implementation	2m 30s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 87 (Div. 2 Only) ›

CF 116A - Tram

We have a single tram traveling along a line with n stops, starting empty at the first stop and ending empty at the last stop. At each stop, a certain number of passengers exit before any new passengers enter.

Practice › Codeforces Solutions › Codeforces Beta Round 87 (Div. 2 Only) ›

CF 116B - Little Pigs and Wolves

We have a small rectangular grid where each cell is either empty, contains a pig, or contains a wolf. A wolf may eat one pig that is directly adjacent to it in one of the four cardinal directions. Once a pig is eaten, it disappears and cannot be eaten again.