A1442.[COCI-2011_2012-contest1]#6 X3

省选/NOI-

COCI

通过率:0%

时间限制:1.00s

内存限制:128MB

题目描述

Mirko has recently been visited by extraterrestrials from planet X3, where everyone’s name is a positive integer. All residents of the planet know each other. Two X3-ians calculate the strength of their friendship by converting their names to binary, aligning them one under the other, and writing a digit in each column: 0 if the two binary digits in that column are equal, 1 if they differ. The binary result is then converted back to the decimal system.
For example, the friendship value of 19 and 10 equals 25:
1 0 0 1 1 = 19 0 1 0 1 0 = 10 1 1 0 0 1 = 25 The value of a planet in the Universe is defined as the sum of all friendship values. Mirko has asked you to help him compute the value of planet X3!

输入格式

The first line of input contains the positive integer N (the number of residents of planet X3, 1 ≤ N ≤
1 000 000). The next N lines contain the names of residents - positive integers smaller than 1 000 000,
one per line.

输出格式

The only line of output must contain the value of planet X
3.

输入输出样例

  • 输入#1

    input 
    2
    19
    10 

    输出#1

    25
  • 输入#2

    3
    7
    3
    5 

    输出#2

    12
  • 输入#3

    5
    9
    13
    1
    9
    6 

    输出#3

    84

说明/提示

Second sample description: The friendship value of residents 1 and 2 equals 4, for residents 1 and 3
it equals 2, and for residents 2 and 3 it equals 6. The solution is 4 + 2 + 6 = 12.

首页