Codeforces Round 157 (Div. 1)

Solutions for Codeforces Round 157 (Div. 1) (contest 258). 1/2 problems verified against sample I/O. Difficulty range: 2000-2600.

4 items

Codeforces Round 157 (Div. 1)

Type: Div. 1 | Problems: 2 | Verified: 1/2 | Rating range: 2000-2600 | Time: 6m 43s

Problem	Name	Rating	Tags	Solve Time	Verified
C	Little Elephant and LCM	2000	binary-search, combinatorics, dp	3m 13s	✗
D	Little Elephant and Broken Sorting	2600	dp, math, probabilities	3m 30s	✓

Practice › Codeforces Solutions › Codeforces Round 157 (Div. 1) ›

CF 258B - Little Elephant and Elections

We are asked to count the number of ways to assign ballot numbers to 7 political parties in a zoo election so that the Little Elephant Political Party (LEPP) ends up with a “luckier” number than the sum of the lucky digits in the other six parties’ numbers.

Practice › Codeforces Solutions › Codeforces Round 157 (Div. 1) ›

CF 258C - Little Elephant and LCM

We are given an array a of length n. From each position i, we are allowed to choose a value bi such that 1 ≤ bi ≤ ai. Once we choose all values, we look at two quantities: the maximum element of the chosen array b, and the least common multiple of all elements in b.

Practice › Codeforces Solutions › Codeforces Round 157 (Div. 1) ›

CF 258D - Little Elephant and Broken Sorting

We are given a permutation of the numbers from 1 to n, and a sequence of m operations. Each operation targets two positions in the array.

Practice › Codeforces Solutions › Codeforces Round 157 (Div. 1) ›

CF 258E - Little Elephant and Tree

We are given a rooted tree with n nodes, numbered from 1 to n, with node 1 as the root. Each node has an initially empty list of numbers.