Codeforces Testing Round 5

3 problems from Codeforces Testing Round 5 (contest 267), difficulty 900-2700. 2/3 solutions verified against sample I/O.

3 items

Codeforces Testing Round 5

Special | 3 problems | 2/3 verified | Difficulty 900-2700 | 6m 13s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Subtractions	900	math, number-theory	9,557	2m 41s	✓
B	Dominoes	2000	dfs-and-similar, graphs	753	1m 39s	✓
C	Berland Traffic	2700	math, matrices	253	1m 53s

Practice › Codeforces Solutions › Codeforces Testing Round 5 ›

CF 267C - Berland Traffic

We are given a directed system of roads connecting a small number of intersections. Each road has a capacity, meaning there is a maximum amount of traffic that can be assigned to it in total, regardless of direction.

Practice › Codeforces Solutions › Codeforces Testing Round 5 ›

CF 267A - Subtractions

We repeatedly apply the same operation to two positive integers. At every step, we subtract the smaller value from the larger one. The process stops as soon as one number becomes zero. The task is to count how many subtraction operations are performed for each pair.

Practice › Codeforces Solutions › Codeforces Testing Round 5 ›

CF 267B - Dominoes

We are given a set of domino tiles, each with two numbers on its halves. The task is to arrange all dominoes in a sequence so that the touching halves of adjacent dominoes have the same number. A domino can be flipped, which swaps its two numbers.