Codeforces Round 467 (Div. 2)

2 problems from Codeforces Round 467 (Div. 2) (contest 937), difficulty 800-1400. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 467 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 800-1400 | 2m 7s

# Problem Rating Tags Accepted Time ✓
A Olympiad 800 implementation, sortings 16,399 1m 2s ✓
B Vile Grasshoppers 1400 brute-force, math, number-theory 7,256 1m 5s ✓
Practice › Codeforces Solutions › Codeforces Round 467 (Div. 2) ›

CF 937B - Vile Grasshoppers

We are given two integers that describe a vertical structure of branches on a tree. The branches are numbered in increasing order, starting from a low level up to some maximum height.
codeforces competitive-programming brute-force math number-theory Jun 17, 2026
Practice › Codeforces Solutions › Codeforces Round 467 (Div. 2) ›

CF 937A - Olympiad

We are given a list of participant scores, and we need to count how many different ways we can choose a group of participants to receive diplomas under a very specific rule. A valid group is determined by picking a score threshold.
codeforces competitive-programming implementation sortings Jun 17, 2026