Codeforces Round 177 (Div. 1)

5 problems from Codeforces Round 177 (Div. 1) (contest 288), difficulty 1300-2800. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 177 (Div. 1)

Div. 1 | 5 problems | 2/5 verified | Difficulty 1300-2800 | 11m 9s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Polo the Penguin and Strings	1300	greedy	6,752	1m 40s	✓
B	Polo the Penguin and Houses	1500	combinatorics	3,210	2m 4s
C	Polo the Penguin and XOR operation	1700	implementation, math	2,457	2m 7s
D	Polo the Penguin and Trees	2400	combinatorics, dfs-and-similar, trees	838	2m 14s
E	Polo the Penguin and Lucky Numbers	2800	dp, implementation, math	347	3m 4s	✓

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

CF 288B - Polo the Penguin and Houses

We are asked to count how many ways we can assign integers to the plaques of n houses in Polo’s village such that three conditions hold. Each house i has a plaque value p₁…pₙ, and Polo can follow the plaques as a chain from one house to the next.

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

CF 288C - Polo the Penguin and XOR operation

We are asked to consider permutations of all integers from 0 to n, inclusive. Polo defines the beauty of a permutation as the sum of XORs of consecutive elements.

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

CF 288E - Polo the Penguin and Lucky Numbers

We are given two extremely large integers, both written using only the digits 4 and 7. They have the same number of digits, and we are guaranteed that the first is strictly smaller than the second.

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

CF 288D - Polo the Penguin and Trees

We are given a tree with n nodes, each node numbered from 1 to n, and n-1 edges connecting them. Polo wants to count pairs of node-to-node paths that do not share any nodes.

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

CF 288A - Polo the Penguin and Strings

We are asked to construct a string of length n that contains exactly k distinct lowercase letters, where no two consecutive letters are the same, and the string is lexicographically smallest among all possibilities.