洛谷P2946 [USACO09MAR]牛飞盘队Cow Frisbee Team

洛谷P2946 [USACO09MAR]牛飞盘队Cow Frisbee Team

动态规划

#include <cstdio> 
#include <cmath> 
#include <cstdlib> 
#include <cstring> 
#include <iostream> 
#include <iomanip> 
#include <algorithm> 
#include <string> 
#define LL long long 
#define For(i,j,k) for(int i=j;i<=k;i++) 
#define Dow(i,j,k) for(int i=j;i>=k;i--) 
using namespace std ; 

const int N = 2011,inf=1e9,Z = 1e8 ;
int n,mod ; 
int f[N][1011],a[N] ; 
 
inline LL read() 
{
    LL x = 0 , f = 1 ; 
    char ch = getchar() ; 
    while(ch<'0'||ch>'9') { if(ch=='-') f = -1 ; ch = getchar() ; } 
    while(ch>='0'&&ch<='9') { x = x * 10+ch-48 ; ch = getchar() ; } 
    return x * f ;  
}

int main() 
{
    n = read() ; mod = read() ; 
    For(i,1,n) a[i]=read() , a[i]%=mod ; 
    For(i,0,n) 
        For(j,0,mod-1) f[i][j]=0 ; 
    f[0][0] = 1 ; 
    
    For(i,1,n) { 
        For(j,0,mod-1) {
            f[i][j]=(f[i][j]+f[i-1][j]) % Z ; 
            f[i][j]=(f[i][j]+f[i-1][ (j-a[i]+mod) % mod ] ) % Z;  
        }
    }
    int ans = 0 ; 
    printf("%d
",f[n][0]-1) ;    //  0 要减一 因为原来的f[0][0] = 1  
    return 0 ; 
}