Codeforces Round 177 (Div. 1)

Solutions for Codeforces Round 177 (Div. 1) (contest 288). 1/2 problems verified against sample I/O. Difficulty range: 1700-2400.

2 items

Codeforces Round 177 (Div. 1)

Type: Div. 1 | Problems: 2 | Verified: 1/2 | Rating range: 1700-2400 | Time: 3m 45s

Problem	Name	Rating	Tags	Solve Time	Verified
C	Polo the Penguin and XOR operation	1700	implementation, math	1m 39s	✗
D	Polo the Penguin and Trees	2400	combinatorics, dfs-and-similar, trees	2m 6s	✓

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

CF 288C - Polo the Penguin and XOR operation

We are given all integers from 0 to n, and we must arrange them into a permutation p. Each position i contributes a value equal to i XOR p[i], and the goal is to maximize the total sum of these contributions over all positions.

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

CF 288D - Polo the Penguin and Trees

We are given a tree with n nodes labeled from 1 to n. A tree is a connected acyclic graph, so every pair of nodes has a unique simple path between them. The task is to count the number of pairs of paths (a, b) and (c, d) that do not share any node.