Codeforces Round 158 (Div. 2)

Solutions for Codeforces Round 158 (Div. 2) (contest 260). 0/3 problems verified against sample I/O. Difficulty range: 1400-2100.

4 items

Codeforces Round 158 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 0/3 | Rating range: 1400-2100 | Time: 5m 48s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Adding Digits	1400	implementation, math	1m 21s	✗
C	Balls and Boxes	1700	constructive-algorithms, greedy, implementation	1m 20s	✗
D	Black and White Tree	2100	constructive-algorithms, dsu, graphs	3m 7s	✗

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

CF 260A - Adding Digits

We are given a number a and a target divisor b, along with a count n representing how many digits we want to append to a. Each operation consists of appending a single digit to the right of the current number such that the new number is divisible by b.

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

CF 260B - Ancient Prophesy

The input is a long string made only of digits and hyphens. Somewhere inside this string, there may be many substrings that look like dates written in the exact format dd-mm-yyyy. We must find which valid date appears most often as 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.

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

CF 260D - Black and White Tree

We are given a tree whose structure has been erased, but two pieces of information remain attached to each vertex: its color and a number that equals the total weight of all edges incident to it in the original tree.