Codeforces Round 198 (Div. 2)

Solutions for Codeforces Round 198 (Div. 2) (contest 340). 1/1 problems verified against sample I/O. Difficulty range: 1600-1600.

1 items

Codeforces Round 198 (Div. 2)

Type: Div. 2 | Problems: 1 | Verified: 1/1 | Rating range: 1600-1600 | Time: 4m 39s

Problem	Name	Rating	Tags	Solve Time	Verified
C	Tourist Problem	1600	combinatorics, implementation, math	4m 39s	✓

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

CF 340C - Tourist Problem

We are asked to compute the average distance a tourist would walk if they visited all destinations on a straight road in every possible order, starting from kilometer zero. Each destination is at a distinct, positive integer distance from the starting point.