AGC029 B - Powers of two
You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.
Score : 600 points
Problem Statement
Takahashi has N balls with positive integers written on them. The integer written on the i-th ball is Ai. He would like to form some number of pairs such that the sum of the integers written on each pair of balls is a power of 2. Note that a ball cannot belong to multiple pairs. Find the maximum possible number of pairs that can be formed.
Here, a positive integer is said to be a power of 2 when it can be written as 2t using some non-negative integer t.
Constraints
- 1≤N≤2×105
- 1≤Ai≤109
- Ai is an integer.
Input
Input is given from Standard Input in the following format:
N A1 A2 ... AN
Output
Print the maximum possible number of pairs such that the sum of the integers written on each pair of balls is a power of 2.
Sample Input 1
3 1 2 3
Sample Output 1
1
We can form one pair whose sum of the written numbers is 4 by pairing the first and third balls. Note that we cannot pair the second ball with itself.
Sample Input 2
5 3 11 14 5 13
Sample Output 2
2
AGC029
- Status
- Done
- Rule
- IOI
- Problem
- 8
- Start at
- 2023-7-13 8:30
- End at
- 2023-7-13 12:00
- Duration
- 3.5 hour(s)
- Host
- Partic.
- 17