Codeforces Round 162 (Div. 1)

Solutions for Codeforces Round 162 (Div. 1) (contest 264). 1/1 problems verified against sample I/O. Difficulty range: 1200-1200.

4 items

Codeforces Round 162 (Div. 1)

Type: Div. 1 | Problems: 1 | Verified: 1/1 | Rating range: 1200-1200 | Time: 1m 5s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Escape from Stones	1200	constructive-algorithms, data-structures, implementation	1m 5s	✓

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

CF 264A - Escape from Stones

We start with a segment representing Liss’s current safe region, initially the interval from 0 to 1. Stones fall one after another, and each stone always lands exactly at the midpoint of Liss’s current interval.

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

CF 264B - Good Sequences

We are given a strictly increasing array of integers. We want to build the longest subsequence such that every pair of neighboring numbers shares at least one common prime factor.

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

CF 264C - Choosing Balls

We have a sequence of balls, each with a color and a value. We may pick any subsequence while preserving order. The score of the chosen subsequence depends on how consecutive chosen balls relate by color.

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

CF 264D - Colorful Stones

We are given two sequences of stones, each colored red, green, or blue, represented as strings s and t. Liss starts on the first stone of the first sequence and Vasya on the first stone of the second sequence.