Codeforces Beta Round 92 (Div. 2 Only)

2 problems from Codeforces Beta Round 92 (Div. 2 Only) (contest 124), difficulty 1000-1400. 2/2 solutions verified against sample I/O.

2 items

Codeforces Beta Round 92 (Div. 2 Only)

Div. 2 | 2 problems | 2/2 verified | Difficulty 1000-1400 | 3m 1s

#	Problem	Rating	Tags	Accepted	Time	✓
A	The number of positions	1000	math	44,196	1m 27s	✓
B	Permutations	1400	brute-force, combinatorics, implementation	4,872	1m 34s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 92 (Div. 2 Only) ›

CF 124A - The number of positions

Petr is standing somewhere in a line containing n people. Positions are numbered from 1 at the front to n at the back. He knows two things about his position. At least a people are standing in front of him, and at most b people are standing behind him.

Practice › Codeforces Solutions › Codeforces Beta Round 92 (Div. 2 Only) ›

CF 124B - Permutations

We are given several strings of digits, all with the same length. We may choose one permutation of digit positions and apply it to every string. After rearranging the digits according to that shared permutation, each string becomes a new integer, possibly with leading zeroes.