A - 2048 Game

A - 2048 Game

You are playing a variation of game 2048. Initially you have a multiset s of n integers. Every integer in this multiset is a power of two.

You may perform any number (possibly, zero) operations with this multiset.

During each operation you choose two equal integers from s, remove them from s and insert the number equal to their sum into s.

For example, if s={1,2,1,1,4,2,2} and you choose integers 2 and 2, then the multiset becomes {1,1,1,4,4,2}.

You win if the number 2048 belongs to your multiset. For example, if s={1024,512,512,4} you can win as follows: choose 512 and 512, your multiset turns into {1024,1024,4}. Then choose 1024 and 1024, your multiset turns into {2048,4} and you win.

You have to determine if you can win this game.

You have to answer q independent queries.

Input
The first line contains one integer q (1≤q≤100) – the number of queries.

The first line of each query contains one integer n (1≤n≤100) — the number of elements in multiset.

The second line of each query contains n integers s1,s2,…,sn (1≤si≤229) — the description of the multiset. It is guaranteed that all elements of the multiset are powers of two.

Output
For each query print YES if it is possible to obtain the number 2048 in your multiset, and NO otherwise.

You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES will all be recognized as positive answer).

Example
Input
6
4
1024 512 64 512
1
2048
3
64 512 2
2
4096 4
7
2048 2 2048 2048 2048 2048 2048
2
2048 4096
Output
YES
YES
NO
NO
YES
YES
Note
In the first query you can win as follows: choose 512 and 512, and s turns into {1024,64,1024}. Then choose 1024 and 1024, and s turns into {2048,64} and you win.

In the second query s contains 2048 initially.

题意：给出的数全是2的幂次方，相同的可以相加合并，看看能不能凑出2048这个东西来或者原数组里面有木有2048。

思路：直接看代码吧，有好多种呢

#include <bits/stdc++.h>
using namespace std;


const int maxn = 110;
int a[maxn];

map<int, int> mp;

int main()
{
	int T;
	cin >> T;
	while (T--)
	{
		mp.clear();
		int n;
		cin >> n;
		int flag = 0;
		for (int i = 1; i <= n; i++)
		{
			cin >> a[i];
			mp[a[i]]++;
			if (a[i] == 2048)
				flag = 1;
		}
		if (flag == 1)
		{
			printf("YES\n");
			continue;
		}
		int k = 2048;
		for (int i = 1; i <= 2048; i *= 2)
		{

			if (mp[i] >= k)
			{
				flag = 1;
				printf("YES\n");
				break;
			}
			else
				mp[i * 2] += mp[i] / 2;
			k /= 2;       //个数，1需要2048个，2需要1024个，......
		}
		if (flag == 0)
			cout << "NO" << endl;
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main(){                      //这个就是把小于2048的数全都加一遍，如果sum >= 2048，就行
	int a;     //想一下，从1到1024，全加起来才是 2047，如果 1到2048，至少存在一个数是成对存在的，从这个数往后加就可以做和得到2048，比如说2是有2个，其余的一个，则2+2+....+1024=2048，其余的也是一样的，这个代码，就是不管顺序，如果能sum >= 2048,在做和过程中就一定能凑出2048。
	scanf("%d",&a); 
	while (a--){
		int b;
		scanf("%d",&b);
		int c;
		int sum=0;
		for(int i=0;i<b;i++){
			scanf("%d",&c);
			if(c<=2048){
				sum=sum+c;
			}
		}
		if(sum>=2048){
			printf("YES\n");
		} else {
			printf("NO\n");
		}
	}
	return 0;
}

#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;

int v[15];
bool judge(int x)
{
    //for(int i=0;i<15;i++)
    //[i]=0;
    int s=log2(x);        把这个数的幂取出来，来代替原数存上
    if(s<=13)
    v[s]++;
    //int a1=v[s];
    for(int i=0;i<=10;i++)
    {
    	//int d=v[i];
        while(v[i]>=2)
        {
        	//int d1=v[i+1];
            v[i+1]=v[i+1]+v[i]/2;  //加的是个数
//int d2=v[i+1];
            v[i]=(v[i]-(v[i]/2)*2);  //减的也是个数
            //int d3=v[i];
        }
    }
    if(v[11]>0)        //当出现2^11^的时候也就是2048的时候就true
    return true;
    else
    return false;
}
int main()
{
    int T;
   scanf("%d",&T);
    int n,m;
    
    while(T--)
    {
        bool flag=false;
	   for(int i=0;i<15;i++)
	   v[i]=0;
        scanf("%d",&n);
        while(n--)
        {
            scanf("%d",&m);
            if(judge(m))
            {
                flag=true;
            }
        }
        if(flag)
        printf("YES\n");
        else
        {
            printf("NO\n");
        }
    }
    return 0;
}