Codeforces Round 268 (Div. 2)

Solutions for Codeforces Round 268 (Div. 2) (contest 469). 2/2 problems verified against sample I/O. Difficulty range: 800-1300.

2 items

Codeforces Round 268 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 800-1300 | Time: 2m 52s

Problem Name Rating Tags Solve Time Verified
A I Wanna Be the Guy 800 greedy, implementation 1m 38s ✓
B Chat Online 1300 implementation 1m 14s ✓
Practice › Codeforces Solutions › Codeforces Round 268 (Div. 2) ›

CF 469A - I Wanna Be the Guy

We have a game with levels numbered from 1 to n. Little X can complete some subset of these levels, and Little Y can complete another subset. They decide to cooperate, which means a level is considered passable if at least one of them can complete it.
codeforces competitive-programming greedy implementation May 30, 2026
Practice › Codeforces Solutions › Codeforces Round 268 (Div. 2) ›

CF 469B - Chat Online

We are asked to count how many different moments in time Little X can wake up such that he overlaps with Little Z online. Little Z has a fixed schedule consisting of multiple segments.
codeforces competitive-programming implementation May 30, 2026