Light oj 1125 - Divisible Group Sums（简单dp）

1125 - Divisible Group Sums

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

Given a list of N numbers you will be allowed to choose any M of them. So you can choose in ^NC_M ways. You will have to determine how many of these chosen groups have a sum, which is divisible by D.

Input

Input starts with an integer T (≤ 20), denoting the number of test cases.

The first line of each case contains two integers N (0 < N ≤ 200) and Q (0 < Q ≤ 10). Here N indicates how many numbers are there and Q is the total number of queries. Each of the next N lines contains one 32 bit signed integer. The queries will have to be answered based on these N numbers. Each of the next Q lines contains two integers D (0 < D ≤ 20) and M (0 < M ≤ 10).

Output

For each case, print the case number in a line. Then for each query, print the number of desired groups in a single line.

Sample Input	Output for Sample Input
2 10 2 1 2 3 4 5 6 7 8 9 10 5 1 5 2 5 1 2 3 4 5 6 6 2	Case 1: 2 9 Case 2: 1

 

---

PROBLEM SETTER: SHAHRIAR MANZOOR

SPECIAL THANKS: JANE ALAM JAN (DESCRIPTION, SOLUTION, DATASET)

注意a[i]有负数

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<map>

#define L(x) (x<<1)
#define R(x) (x<<1|1)
#define MID(x,y) ((x+y)>>1)

#define bug printf("hihi\n")

#define eps 1e-12

typedef __int64 ll;

using namespace std;
#define INF 0x3f3f3f3f
#define N 203

ll dp[N][30][30];

int a[N];

int n,m,mod;

ll DP()
{
    int i,j;
    memset(dp,0,sizeof(dp));
    dp[0][0][0]=1;
    for(int i=0;i<n;i++)
        for(int j=0;j<=m;j++)
           for(int k=0;k<mod;k++)
           {
               dp[i+1][j][k]+=dp[i][j][k];
               dp[i+1][j+1][((a[i+1]%mod)+mod+k)%mod]+=dp[i][j][k];
           }
      return dp[n][m][0];
}

int main()
{
    int i,j,q,ca=0,t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&q);
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
            printf("Case %d:\n",++ca);
        while(q--)
        {
            scanf("%d%d",&mod,&m);
            printf("%lld\n",DP());
        }
    }
    return 0;
}