代码

#include<iostream>
#include<cstdio>
#include<cstring>
int t,a[1010],n;
int read();
void write(int);
bool dfs(int,int);
int main()
{
    t=read();
    for(int i=1;i<=t;i++)
    {
        n=read();
        memset(a,0,sizeof(a));
        int ans=n;
        for(int j=1;j<=n;j++)
            a[j]=read();
        for(int j=1;j<=n;j++)
        {
            if(dfs(a[j],j)) ans--;
        }
        write(ans);putchar('\n');
        //printf("%d\n",ans);
    } 
    return 0;
}
int read()
{
    int _=0,___=1;char __=getchar();
    while(__<'0'||__>'9')
    {
        if(__=='-') ___=-1;
        __=getchar();
    }
    while(__>='0'&&__<='9')
    {
        _=_*10+__-'0';
        __=getchar();
    }
    return _*___;
}
void write(int Num)
{
    if(Num<0) putchar('-'),Num*=-1;
    if(Num>=10) write(Num/10);
    putchar(Num%10+'0');
}
bool dfs(int ask,int node)
{
    bool ok=0;
    if(ask==0)
        ok=1;
    for(int i=1;i<=n&&!ok;i++)
        if(a[i]<=ask&&i!=node) ok= ok ||dfs(ask-a[i],node);
    return ok;
}

评测结果