Codeforces Educational Codeforces Round 15 B. Powers of Two

B. Powers of Two

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given n integers a₁, a₂, ..., a_n. Find the number of pairs of indexes i, j (i < j) that a_i + a_j is a power of 2 (i. e. some integer x exists so that a_i + a_j = 2^x).

Input

The first line contains the single positive integer n (1 ≤ n ≤ 10⁵) — the number of integers.

The second line contains n positive integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹).

Output

Print the number of pairs of indexes i, j (i < j) that a_i + a_j is a power of 2.

Examples

Input

4
7 3 2 1

Output

2

Input

3
1 1 1

Output

3

Note

In the first example the following pairs of indexes include in answer: (1, 4) and (2, 4).

In the second example all pairs of indexes (i, j) (where i < j) include in answer.

 

题目链接：http://codeforces.com/contest/702/problem/B

 

2^32是大于1e9的，n^2的复杂度，内层用2的幂次单独判断，用map处理每个数出现的次数。最后+1，开始时候的判断只会判断已经加入map中的数，所以不会出现重复的情况。

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <algorithm>
 4 #include <map>
 5 using namespace std;
 6 map<long long, long long>m;
 7 int main()
 8 {
 9     int n;
10     cin >> n;
11     long long t;
12     long long ans=0;
13     for(int i=0;i<n;i++)
14     {
15         cin >> t;
16         for(int j = 0; j < 32; j++)
17         {
18             ans+=m[(2<<j)-t];
19         }
20         m[t]++;
21      } 
22     cout << ans;
23     return 0;
24 }

查看代码

 

转载于:https://www.cnblogs.com/Mino521/p/5721996.html