Codeforces Round 150 (Div. 2)

2 problems from Codeforces Round 150 (Div. 2) (contest 244), difficulty 900-1600. 1/2 solutions verified against sample I/O.

2 items

Codeforces Round 150 (Div. 2)

Div. 2 | 2 problems | 1/2 verified | Difficulty 900-1600 | 4m 21s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Dividing Orange	900	implementation	8,564	3m 13s
B	Undoubtedly Lucky Numbers	1600	bitmasks, brute-force, dfs-and-similar	4,931	1m 8s	✓

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

CF 244A - Dividing Orange

We are asked to divide an orange consisting of nk segments among k children so that each child receives exactly n segments, each child definitely receives the segment they chose, and no segment is given to more than one child.

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

CF 244B - Undoubtedly Lucky Numbers

We are given a single positive integer $n$, and we need to count how many integers from 1 up to $n$ have a very specific property: there exists a pair of digits $x$ and $y$ such that every digit in the number’s decimal representation is either $x$ or $y$.