프로그램 명: coci_x3
제한시간: 1 초
[문제요약]
n 개의 수를 받아 가능한 두 개의 조합으로 이진 연산을 하여 각 비트 끼리 같으면 0 , 아니면 1 로 변환 후 이를 십진수로 돌린 값의
합을 구하는 문제.
예를 들어 n = 3 이고 7 , 3, 5 가 주어지면
- 7 , 3
111
011
----
100 ... 4
- 7, 5
111
101
----
010 ... 2
- 3 , 5
011
101
---
110 .... 6
합은 4 + 2 + 6 = 12
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 X3.
입출력 예
input
2
19
10
output
25
input
3
7
3
5
output
12
input
5
9
13
1
9
6
output
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.
출처:coci 2011 contest1 3/6
[질/답]
[제출 현황]
[푼 후(0)]