Codeforces Round 743 (Div. 2)

Solutions for Codeforces Round 743 (Div. 2) (contest 1573). 0/2 problems verified against sample I/O. Difficulty range: 800-1400.

2 items

Codeforces Round 743 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 0/2 | Rating range: 800-1400 | Time: 7m 11s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Countdown	800	greedy	5m 22s	✗
B	Swaps	1400	greedy, math, sortings	1m 49s	✗

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

CF 1573A - Countdown

The problem presents a digital clock showing an integer with exactly $n$ digits. Each digit ranges from 0 to 9, and the display includes leading zeroes so the number always has length $n$. The goal is to reduce this number to zero with the fewest possible operations.

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

CF 1573B - Swaps

We are given two arrays of length $n$, where array $a$ contains all the odd numbers from $1$ to $2n$ in some order, and array $b$ contains all the even numbers from $1$ to $2n$ in some order.