Codeforces Round 204 (Div. 2)

2 problems from Codeforces Round 204 (Div. 2) (contest 352), difficulty 1000-1300. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 204 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 1000-1300 | 3m 51s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Jeff and Digits	1000	brute-force, implementation, math	28,531	2m 26s	✓
B	Jeff and Periods	1300	implementation, sortings	18,163	1m 25s	✓

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

CF 352A - Jeff and Digits

We are given a multiset of cards, each card showing either the digit 0 or the digit 5. From these cards we may choose any subset and arrange the chosen digits into a number written in a single line. Our goal is to build the largest possible number that is divisible by 90.

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

CF 352B - Jeff and Periods

We are given a sequence of integers, and for each distinct value we want to understand how its occurrences are spaced across the array. For any value $x$, we look at all indices where $x$ appears.