hdu 4277 2012长春赛区网络赛 dfs+hashmap ***

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<map>
using namespace std;
#define MOD 1000000007
const int INF=0x3f3f3f3f;
const double eps=1e-5;
typedef long long ll;
#define cl(a) memset(a,0,sizeof(a))
#define ts printf("*****\n");
const int MAXN=1005;
int n,m,tt;
int sum=0,a[MAXN];
const int HASH = 1000007;
struct HASHMAP
{
int head[HASH],next[HASH],size;
int state[HASH][3];
int hash(int a,int b,int c)
{
return (((a*7+b)*7+c)*7)%HASH;　　//131
}
void init()
{
size = 0;
memset(head,-1,sizeof(head));
}
int insert(int a,int b,int c)
{
int h = hash(a,b,c);
for(int i = head[h]; i != -1;i = next[i])
if(a == state[i][0]&&b == state[i][1]&&c == state[i][2])
{
return 1;
}
state[size][0]=a,state[size][1]=b,state[size][2]=c;
next[size] = head[h];
head[h] = size++;
return 0;
}
} H1;
bool check(int a1,int a2,int a3)
{
if(a1+a2>a3&&a1+a3>a2&&a2+a3>a1)   return 1;
else return 0;
}
void dfs(int a1,int a2,int a3,int pos)
{
if(a3>sum/3)    return;
if(pos>=n)
{
if(a1==0||a2==0||a3==0) return;
if(check(a1,a2,a3)&&a1>=a2&&a2>=a3)
{
H1.insert(a1,a2,a3);
}
return;
}
dfs(a1+a[pos],a2,a3,pos+1);
dfs(a1,a2+a[pos],a3,pos+1);
dfs(a1,a2,a3+a[pos],pos+1);
}

int main()
{
int i,j,k,ca=1;
#ifndef ONLINE_JUDGE
freopen("1.in","r",stdin);
#endif
scanf("%d",&tt);
while(tt--)
{
H1.init();
sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)    scanf("%d",a+i),sum+=a[i];
dfs(0,0,0,0);
printf("%d\n",H1.size);
}
}