Codeforces Round 125 (Div. 2)

2 problems from Codeforces Round 125 (Div. 2) (contest 199), difficulty 900-1900. 1/2 solutions verified against sample I/O.

2 items

Codeforces Round 125 (Div. 2)

Div. 2 | 2 problems | 1/2 verified | Difficulty 900-1900 | 3m 12s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Hexadecimal's theorem	900	brute-force, constructive-algorithms, implementation	30,282	1m 37s	✓
B	Special Olympics	1900	geometry	877	1m 35s

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

CF 199A - Hexadecimal's theorem

We are given a single integer n, and the statement guarantees that n itself is a Fibonacci number. The task is to represent n as the sum of three Fibonacci numbers.

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

CF 199B - Special Olympics

We are asked to count the number of distinct circular contours that can be formed on a plane where two black-painted rings are placed. Each ring is defined by two concentric circles, an inner radius and an outer radius.