poj1285 combinations, once again

#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cctype> 
using namespace std;
typedef long long ll;
int (){
    int f=1,x=0;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-f;c=getchar();}
    while(c>='0'&&c<='9')x=x*10+c-'0',c=getchar();
    return f*x; 
}
int n[56],N,q,r;
ll f[56];
void packX(int d){
    int p=1,_n,j;
    for(j=N;j>=0;j--)
        for(_n=1;_n<=min(n[d],j);_n++)
            f[j]+=f[j-_n];
} 
int main(){
    int i,j,T=1;
    for(;;T++){
        memset(n,0,sizeof(n));
        memset(f,0,sizeof(f));
        scanf("%d%d",&N,&q);
        if(!N&&!q)break;
        for(i=0;i<N;i++)
            scanf("%d",&j),
            n[j-1]++;
        for(f[0]=1ll,i=0;i<N;i++)
            packX(i);
        printf("Case %d:n",T);
        for(i=0;i<q;i++)
            scanf("%d",&r),
            printf("%lldn",f[r]);
    }
    return 0;
}