this code for the problem MARCHA1 in easy section of codedhef practise probs… dunno y is it givng RE… plzz help
#include#include<math.h>
int main()
{
int t,n,m,ar[20],i,k,temp,num,sum=0,flag=0;
scanf("%d",&t);
while(t–)
{
flag=0;
scanf("%d%d",&n,&m);
num=n;
k=0;
while(num–)
{
scanf("%d",&temp);
if(temp<m)
ar[k++]=temp;else if(temp==m)
{
printf("Yes\n"); flag=1; break;}
}
temp=pow(2,k);
for(i=0;i<temp;i++)
{
sum=0;
for(k=0;k<n;k++)
{
if(i&1<<k) { sum=sum+ar[k]; }}
if(sum==m)
{
printf("Yes\n"); flag=1; break;}
}
if(flag==0)
printf(“No\n”);
}
return 0;
}