hdu2152母函数

比较简单，直接贴代码

/*
 * hdu2152/win.cpp
 * Created on: 2012-7-18
 * Author    : ben
 */
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <functional>
#include <numeric>
#include <cctype>
using namespace std;
const int MAXN = 105;
const int MAXV = 10100;
int N, M;
int mins[MAXN], maxs[MAXN];
int res[MAXV], temp[MAXV];

int main() {
#ifndef ONLINE_JUDGE
    freopen("data.in", "r", stdin);
#endif
    while(scanf("%d%d", &N, &M) == 2) {
        for(int i = 0; i < N; i++) {
            scanf("%d%d", &mins[i], &maxs[i]);
        }
        memset(res, 0, sizeof(res));
        for(int k = mins[0]; k <= maxs[0]; k++) {
            res[k] = 1;
        }
        for(int i = 1; i < N; i++) {
            memset(temp, 0, sizeof(temp));
            for(int k = mins[i]; k <= maxs[i]; k++) {
                for(int j = 0; j < MAXV; j++) {
                    if(res[j] > 0) {
                        temp[k + j] += res[j];
                    }
                }
            }
            memcpy(res, temp, sizeof(temp));
        }
        printf("%d\n", res[M]);
    }
    return 0;
}