Codeforces Round 728 (Div. 2)

Solutions for Codeforces Round 728 (Div. 2) (contest 1541). 1/2 problems verified against sample I/O. Difficulty range: 800-1200.

2 items

Codeforces Round 728 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 1/2 | Rating range: 800-1200 | Time: 4m 32s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Pretty Permutations	800	constructive-algorithms, greedy, implementation	2m 57s	✗
B	Pleasant Pairs	1200	brute-force, implementation, math	1m 35s	✓

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

CF 1541A - Pretty Permutations

We are asked to reorder a sequence of cats standing in a line so that no cat remains in its original position, while also minimizing the total distance each cat moves. The input consists of several test cases, each specifying a single integer $n$ - the number of cats.

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

CF 1541B - Pleasant Pairs

We are given several test cases, each containing an array of distinct integers indexed from 1. The task is to count how many index pairs $(i, j)$ with $i < j$ satisfy a very specific relationship: the product of the values stored at those positions equals the sum of the…