Codeforces Round 829 (Div. 2)

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

2 items

Codeforces Round 829 (Div. 2)

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

Problem	Name	Rating	Tags	Solve Time	Verified
A	Technical Support	800	greedy	1m 52s	✗
B	Kevin and Permutation	800	constructive-algorithms, greedy, math	5m 38s	✗

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

CF 1754B - Kevin and Permutation

We are asked to rearrange the integers from 1 to n in a sequence such that the smallest difference between any two consecutive numbers is as large as possible.

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

CF 1754A - Technical Support

We are given a sequence of chat messages consisting only of two types: client questions and support answers. The conversation is written in time order, and the first message is always a question.