From Evernote:

uva 10616

這題DP沒看過，仔細一看 貌似是背包問題，不過還是不會 只好參考GOOGLE大大了

[sourcecode language="cpp"]
//============================================================================
// Name : Divisible Group Sums.cpp
// Date : 2013 2013/2/20 下午9:08:06
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
printf("%d ",dp[htx][hty]);}Pln();}
#define M 205
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int n,query;
ll dp[M][M][M];
ll a[M];
int main() {
ios_base::sync_with_stdio(0);
int ff=0;
while(~scanf("%d%d",&n,&query)&&n+query){
for(int i=1;i<=n;i++){
scanf("%lld",&a[i]);
}
printf("SET %d:\n",++ff);
for(int f=0;f<query;f++){
int m,d;
scanf("%d%d",&d,&m);
Set(dp,0);
dp[0][0][0]=1;
for(int i=1;i<=n;i++){
for(int j=0;j<=m;j++){
for(int k=0;k<d;k++){
dp[i][j][k]=dp[i-1][j][k];
if(j>0){
int tmp=(d+k-a[i]%d)%d;
dp[i][j][k]+=dp[i-1][j-1][tmp];
}
}
}
}
printf("QUERY %d: %lld\n",f+1,dp[n][m][0]);
}
}
}

[/sourcecode]