Codeforces Round 142 (Div. 2)

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

2 items

Codeforces Round 142 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 1000-1300 | 4m 23s

# Problem Rating Tags Accepted Time ✓
A Dragons 1000 greedy, sortings 97,428 3m 28s ✓
B T-primes 1300 binary-search, implementation, math 95,758 55s ✓
Practice › Codeforces Solutions › Codeforces Round 142 (Div. 2) ›

CF 230A - Dragons

Kirito starts with some initial strength and must defeat every dragon on the level. Each dragon has two values: the minimum strength needed to beat it, and the bonus strength Kirito gains afterward.
codeforces competitive-programming greedy sortings May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 142 (Div. 2) ›

CF 230B - T-primes

We are asked to identify T-primes in a list of positive integers. A T-prime is defined as a number that has exactly three distinct positive divisors. Thinking about divisors, the only way a number can have exactly three is if it is the square of a prime number.
codeforces competitive-programming binary-search implementation math number-theory May 29, 2026