Quantcast
Channel: CodeChef Discuss - latest questions
Viewing all articles
Browse latest Browse all 39796

paying up wrong answer

$
0
0
 #include<iostream>
 #include<math.h>
 using namespace std;
 int main(){
int ans,size,test;
cin>>test;
for(int i=0;i<test;i++)
{
cin>>size;
cin>>ans;
int a[size];
for(int i=0;i<size;i++)
    cin>>a[i];
int k=pow(2,size);
int flag=0;
for(int i=0;i<k;i++)
{
    int sum=0;
    for(int j=0;j<size;j++)
    {
        int k=(1<<j);
        int m=(i&k);
        if(m!=0)
        {
            sum=sum+a[size-1-j];
        }
    }
    if(sum==ans)
        {
            flag=1;
        }
}
    if(flag==0)
        cout<<"NO"<<"\n";
    else
        cout<<"YES"<<"\n";
}

}


Viewing all articles
Browse latest Browse all 39796

Trending Articles



<script src="https://jsc.adskeeper.com/r/s/rssing.com.1596347.js" async> </script>