Codeforces Round 125 (Div. 2)

Solutions for Codeforces Round 125 (Div. 2) (contest 199). 1/2 problems verified against sample I/O. Difficulty range: 900-1900.

2 items

Codeforces Round 125 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 1/2 | Rating range: 900-1900 | Time: 3m 12s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Hexadecimal's theorem	900	brute-force, constructive-algorithms, implementation	1m 37s	✓
B	Special Olympics	1900	geometry	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.