Codeforces Round 120 (Div. 2)

Solutions for Codeforces Round 120 (Div. 2) (contest 190). 4/4 problems verified against sample I/O. Difficulty range: 1100-1900.

4 items

Codeforces Round 120 (Div. 2)

Type: Div. 2 | Problems: 4 | Verified: 4/4 | Rating range: 1100-1900 | Time: 6m 10s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Vasya and the Bus	1100	greedy, math	1m 11s	✓
B	Surrounded	1800	geometry	1m 34s	✓
C	STL	1500	dfs-and-similar	1m 49s	✓
D	Non-Secret Cypher	1900	two-pointers	1m 36s	✓

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

CF 190A - Vasya and the Bus

We are asked to compute the minimum and maximum bus fare that a group of passengers could pay under specific rules. There are two groups of passengers: grown-ups and children. Every grown-up pays one ruble for themselves, and they can each bring at most one child for free.

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

CF 190B - Surrounded

We are given two circles on the plane. Each circle represents an enemy ring surrounding a city. A radar can be placed at any point, and it detects everything within distance r from its position. The radar must be able to detect at least one point from each circle.

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

CF 190C - STL

We are given a sequence of words that originally described a type in a fictional language. The language has only two valid constructions. The simplest type is int. The second type is pair<type,type, where each side is itself another valid type.

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

CF 190D - Non-Secret Cypher

We are given an array of integers and a number k. We need to count how many contiguous subarrays contain some value at least k times. The condition is not about having k distinct equal pairs or anything global across the subarray.