map简单题（Codeforces Round #496 (Div. 3)___C题）

http://codeforces.com/contest/1005/problem/C

C. Summarize to the Power of Two

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

A sequence $a_1,a_2,\dots ,a_n$ is called good if, for each element $a_i$, there exists an element $a_j$ ($i\ne j$) such that $a_i+a_j$ is a power of two (that is, $2^d$ for some non-negative integer $d$).

For example, the following sequences are good:

• $[5,3,11]$ (for example, for $a_1=5$ we can choose $a_2=3$. Note that their sum is a power of two. Similarly, such an element can be found for $a_2$ and $a_3$),
• $[1,1,1,1023]$,
• $[7,39,89,25,89]$,
• $\left[\right]$.

Note that, by definition, an empty sequence (with a length of $0$) is good.

For example, the following sequences are not good:

• $\left[16\right]$ (for $a_1=16$, it is impossible to find another element $a_j$ such that their sum is a power of two),
• $[4,16]$ (for $a_1=4$, it is impossible to find another element $a_j$ such that their sum is a power of two),
• $[1,3,2,8,8,8]$ (for $a_3=2$, it is impossible to find another element $a_j$ such that their sum is a power of two).

You are given a sequence $a_1,a_2,\dots ,a_n$. What is the minimum number of elements you need to remove to make it good? You can delete an arbitrary set of elements.

Input

The first line contains the integer $n$ ($1\le n\le 120000$) — the length of the given sequence.

The second line contains the sequence of integers $a_1,a_2,\dots ,a_n$ ($1\le a_i\le {10}^9$).

Output

Print the minimum number of elements needed to be removed from the given sequence in order to make it good. It is possible that you need to delete all $n$ elements, make it empty, and thus get a good sequence.

Examples

input

Copy

6
4 7 1 5 4 9

output

Copy

1

input

Copy

5
1 2 3 4 5

output

Copy

2

input

Copy

1
16

output

Copy

1

input

Copy

4
1 1 1 1023

output

Copy

0

Note

In the first example, it is enough to delete one element $a_4=5$. The remaining elements form the sequence $[4,7,1,4,9]$, which is good.

题意分析：给一串数字，依次判断其中的每个数字若能和其它数字相加后合为2的幂数就没事，若和其它任意一个数字（不能是它本身）相加后都不为2的幂数，就要把这个数字删掉，问一共要删多少数字。

用map映射来查找~代码如下：

#include <iostream>
#include <map>


using namespace std;


int main()
{
	int n,x,k=0,del=0;
	map<int,int>c;
	cin>>n;
	int a[n];
	for(int i=0;i<n;i++) {cin>>a[i];c[a[i]]++;}
	for(int i=0;i<n;i++)
	{
		k=0;
		for(int d=0;d<31;d++)  //2^30=1,073,741,824 刚刚超过10^9
		{
			x=(1<<d)-a[i];//判断有没有ai+aj是2的几次方,即遍历2的次方(不超过30),判断减去原数的差值是不是题目给出的数
			if((c.count(x))&&((c[x]>1)||((c[x]==1)&&(x!=a[i])))) k=1;//ai+aj中i!=j
		}
		if(k!=1) del++;//没找到那个aj则需要删掉这个ai 要删除的元素个数++
	}
	cout<<del<<endl;
	return 0;
}
/*int isPow2(int a) 
{
  return !(a&(a-1));    //很方便的判断方法~虽然这题没用,每两个数都加一次会超时)
}*/

Note that in C++ solutions, it's better to first check that  $s-a\left[i\right]$  is a key in  $c$ , and only after it calculate  $c[s-a[i\left]\right]$

. This needs to be done, since in C++ when you access a key using the "square brackets" operator, a default mapping key-value is created on the absence of the key. This increases both the running time and the memory consumption

访问未经定义的键创建那个键，耗费时间和内存，可能会RE~（体现在代码第21行的(c.count(x)）