选择我自己的算法

#include<iostream>
#include<stdio.h>
#include<cmath>
#include<string.h>
#include<map>
#include<queue>
#include<algorithm>
using namespace std;
int cunshu[10]={0};
bool chuli(int temptemp,int k)
{
if(k==0)
{
if(temptemp<=9)
{
if(cunshu[temptemp]==1)
return true;
else
return false;
}else
return false;
}
for(int i=0;i<=9;i++)
{
if(cunshu[i]==1)
{
if(chuli(temptemp-i,k-1))
return true;
}
}
for(int i=1;i<=9;i++)
{
if(cunshu[i]==1)
{
if(temptemp%i==0)
{
if(chuli(temptemp/i,k-1))
return true;
}
}
}
if(temptemp==0)
{
if(cunshu[0]==1)
{
return true;
}
}
return false;
}
int main()
{
int cishu;
int mubiaogeshu;
int mubiaozhi;
int shuzhigeshu;
int temp;
cin>>cishu>>shuzhigeshu;
for(int i=0;i<shuzhigeshu;i++)
{
cin>>temp;
cunshu[temp]=1;
}
cin>>mubiaogeshu;
for(int j=0;j<mubiaogeshu;j++)
{
cin>>mubiaozhi;
if(chuli(mubiaozhi,cishu))
{
cout<<"Y"<<endl;
}else
{
cout<<"N"<<endl;
}
}
return 0;
}