Codeforces Round 162 (Div. 2)

Solutions for Codeforces Round 162 (Div. 2) (contest 265). 1/2 problems verified against sample I/O. Difficulty range: 800-1000.

2 items

Codeforces Round 162 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 1/2 | Rating range: 800-1000 | Time: 2m 41s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Colorful Stones (Simplified Edition)	800	implementation	1m 17s	✗
B	Roadside Trees (Simplified Edition)	1000	greedy, implementation	1m 24s	✓

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

CF 265A - Colorful Stones (Simplified Edition)

The problem describes a row of stones, each colored red, green, or blue, represented by a string s of characters 'R', 'G', and 'B'. Squirrel Liss starts on the first stone and executes a sequence of color-based instructions, given by a second string t.

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

CF 265B - Roadside Trees (Simplified Edition)

We have a sequence of trees along a straight street. Each tree has a certain height, and on top of each tree is a nut that Squirrel Liss wants to eat. Liss starts at the base of the first tree.