Codeforces Round 562 (Div. 2)

Solutions for Codeforces Round 562 (Div. 2) (contest 1169). 2/2 problems verified against sample I/O. Difficulty range: 900-1500.

2 items

Codeforces Round 562 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 900-1500 | Time: 3m 38s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Circle Metro	900	implementation, math	2m 23s	✓
B	Pairs	1500	graphs, implementation	1m 15s	✓

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

CF 1169A - Circle Metro

Two trains move on a circular line with stations labeled from 1 to n. One train moves clockwise, increasing station numbers modulo n, while the other moves counterclockwise, decreasing station numbers modulo n.

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

CF 1169B - Pairs

We are given a collection of integer pairs, each element ranging from 1 to some upper bound $n$. Our task is to find whether there exist two integers $x$ and $y$ such that every pair contains at least one of these two integers. In other words, $x$ or $y$ must "cover" every pair.