Codeforces Round 773 (Div. 2)

Solutions for Codeforces Round 773 (Div. 2) (contest 1642). 0/2 problems verified against sample I/O. Difficulty range: 800-900.

2 items

Codeforces Round 773 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 0/2 | Rating range: 800-900 | Time: 4m 15s

Problem Name Rating Tags Solve Time Verified
A Hard Way 800 geometry 2m 34s ✗
B Power Walking 900 greedy 1m 41s ✗
Practice › Codeforces Solutions › Codeforces Round 773 (Div. 2) ›

CF 1642A - Hard Way

This problem is rated 3500 and its solution relies on a fairly deep structural characterization of graphs whose cycle space admits a consistent cyclic orientation.
codeforces competitive-programming geometry Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 773 (Div. 2) ›

CF 1642B - Power Walking

We are given a multiset of values, where each value represents a type of power-up. The task is not to assign individual power-ups arbitrarily, but to distribute all of them into exactly $k$ non-empty groups, where each group represents a child.
codeforces competitive-programming greedy Jun 10, 2026