Codeforces Round 277.5 (Div. 2)

Solutions for Codeforces Round 277.5 (Div. 2) (contest 489). 0/4 problems verified against sample I/O. Difficulty range: 1200-2300.

4 items

Codeforces Round 277.5 (Div. 2)

Type: Div. 2 | Problems: 4 | Verified: 0/4 | Rating range: 1200-2300 | Time: 38m 30s

Problem	Name	Rating	Tags	Solve Time	Verified
A	SwapSort	1200	greedy, implementation, sortings	11m 31s	✗
C	Given Length and Sum of Digits...	1400	dp, greedy, implementation	10m 53s	✗
E	Hiking	2300	binary-search, dp	5m 18s	✗
F	Special Matrices	2100	combinatorics, dp	10m 48s	✗

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

CF 489A - SwapSort

We are given an array of integers and must transform it into non-decreasing order using swaps. The output is not the sorted array itself. Instead, we must print a sequence of index pairs, where each pair represents a swap performed on the array.

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

CF 489C - Given Length and Sum of Digits...

We are asked to construct two numbers of a specified length, m, whose digits sum to a given value, s. The first number should be the smallest possible, the second the largest. Both numbers are expressed in base 10 and cannot have leading zeroes unless the number is zero itself.

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

CF 489E - Hiking

Codeforces 489E: Hiking

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

CF 489F - Special Matrices

We are asked to count the number of special square matrices of size n×n, where each row and column contains exactly two ones, and all other cells are zeros.