Codeforces Round 162 (Div. 2)

2 problems from Codeforces Round 162 (Div. 2) (contest 265), difficulty 800-1000. 1/2 solutions verified against sample I/O.

2 items

Codeforces Round 162 (Div. 2)

Div. 2 | 2 problems | 1/2 verified | Difficulty 800-1000 | 2m 41s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Colorful Stones (Simplified Edition)	800	implementation	42,658	1m 17s
B	Roadside Trees (Simplified Edition)	1000	greedy, implementation	17,923	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.