Codeforces Round 158 (Div. 2)

5 problems from Codeforces Round 158 (Div. 2) (contest 260), difficulty 1400-2500. 1/5 solutions verified against sample I/O.

5 items

Codeforces Round 158 (Div. 2)

Div. 2 | 5 problems | 1/5 verified | Difficulty 1400-2500 | 10m 33s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Adding Digits	1400	implementation, math	16,578	2m 26s
B	Ancient Prophesy	1600	brute-force, implementation, strings	4,089	2m 10s	✓
C	Balls and Boxes	1700	constructive-algorithms, greedy, implementation	3,228	1m 20s
D	Black and White Tree	2100	constructive-algorithms, dsu, graphs	1,665	2m 32s
E	Dividing Kingdom	2500	binary-search, brute-force, data-structures	510	2m 5s

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

CF 260A - Adding Digits

We start with a number a. We want to extend it exactly n times. A single extension means appending one decimal digit to the right of the current number. The digit can be anything from 0 to 9, but after appending it, the resulting number must be divisible by b.

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

CF 260E - Dividing Kingdom

Error in message stream

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

CF 260D - Black and White Tree

Error in message stream

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

CF 260B - Ancient Prophesy

The input is a long string consisting only of digits and the character -. Somewhere inside this string there may be many substrings that look like dates written exactly as dd-mm-yyyy. Our task is to find the valid date that appears most often as such a substring.

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

CF 260C - Balls and Boxes

We are given the final state of a row of boxes after a very specific operation was applied exactly once in reverse history. Originally, each box contained some number of balls.