CodeForces 340C Tourist Problem（组合排列，公式推导）

C. Tourist Problem

time limit per test

 1 second

memory limit per test

 256 megabytes

input

 standard input

output

 standard output

Iahub is a big fan of tourists. He wants to become a tourist himself, so he planned a trip. There are n destinations on a straight road that Iahub wants to visit. Iahub starts the excursion from kilometer 0. The n destinations are described by a non-negative integers sequencea1, a2, ..., an. The number ak represents that the kth destination is at distance