Codeforces Round 262 (Div. 2)

5 problems from Codeforces Round 262 (Div. 2) (contest 460), difficulty 900-2700. 4/5 solutions verified against sample I/O.

5 items

Codeforces Round 262 (Div. 2)

Div. 2 | 5 problems | 4/5 verified | Difficulty 900-2700 | 6m 14s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Vasya and Socks	900	brute-force, implementation, math	52,010	1m 32s	✓
B	Little Dima and Equation	1500	brute-force, implementation, math	13,371	1m 6s	✓
C	Present	1700	binary-search, data-structures, greedy	6,785	1m	✓
D	Little Victor and Set	2300	brute-force, constructive-algorithms, math	1,036	1m 21s
E	Roland and Rose	2700	brute-force, geometry, math	382	1m 15s	✓

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

CF 460A - Vasya and Socks

Vasya starts with a certain number of sock pairs. Every morning he uses exactly one pair, and that pair is gone forever at the end of the day. There is one special event: after every day whose number is a multiple of m, his mother buys him one new pair of socks.

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

CF 460B - Little Dima and Equation

The task asks us to find all positive integers less than one billion that satisfy the equation $$x = b cdot s(x) cdot a + c$$ where $a$, $b$, and $c$ are given constants, and $s(x)$ is the sum of the digits of $x$.

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

CF 460C - Present

We are asked to maximize the minimum height of flowers after a limited number of days of watering. Each flower has an initial height, and on any day we can water a contiguous segment of exactly w flowers, increasing each by one.

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

CF 460D - Little Victor and Set

Victor wants to build a set of integers within a specified range such that the XOR of all its elements is minimized. The set can contain up to k elements, all distinct, and every element must lie between l and r inclusive.

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

CF 460E - Roland and Rose

Roland wants to place n watch towers on a 2D integer grid around a rose at the origin so that the sum of squared distances between all pairs of towers is maximized. Each tower must lie within or on a circle of radius r centered at (0,0).