Codeforces Round 131 (Div. 2)

Solutions for Codeforces Round 131 (Div. 2) (contest 214). 2/2 problems verified against sample I/O. Difficulty range: 800-1600.

2 items

Codeforces Round 131 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 800-1600 | Time: 3m 45s

Problem	Name	Rating	Tags	Solve Time	Verified
A	System of Equations	800	brute-force	56s	✓
B	Hometask	1600	brute-force, constructive-algorithms, greedy	2m 49s	✓

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

CF 214A - System of Equations

We need to count how many non-negative integer pairs (a, b) satisfy two equations at the same time: - a² + b = n - a + b² = m The input gives the two target values n and m.

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

CF 214B - Hometask

We are given a multiset of digits and asked to construct the largest integer from some or all of them such that the resulting number is divisible by 2, 3, and 5 simultaneously.