shunfurh
编程介的小学生
2017-10-11 13:15

Moo Volume

  • lines
  • each

Description

Farmer John has received a noise complaint from his neighbor, Farmer Bob, stating that his cows are making too much noise.

FJ's N cows (1 <= N <= 10,000) all graze at various locations on a long one-dimensional pasture. The cows are very chatty animals. Every pair of cows simultaneously carries on a conversation (so every cow is simultaneously MOOing at all of the N-1 other cows). When cow i MOOs at cow j, the volume of this MOO must be equal to the distance between i and j, in order for j to be able to hear the MOO at all. Please help FJ compute the total volume of sound being generated by all N*(N-1) simultaneous MOOing sessions.
Input

  • Line 1: N

  • Lines 2..N+1: The location of each cow (in the range 0..1,000,000,000).
    Output

There are five cows at locations 1, 5, 3, 2, and 4.
Sample Input

5
1
5
3
2
4
Sample Output

40

  • 点赞
  • 回答
  • 收藏
  • 复制链接分享

1条回答

为你推荐