题意:k类麻将牌,没类4张,抽取m张胡牌的方案有多少种,方案不同指抽取的k张牌不同
http://acm.hdu.edu.cn/showproblem.php?pid=5548
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <queue>
using namespace std;
#define N (300010)
#define M (2000020)
#define LL long long
#define ULL unsigned long long
#define eps 1e-8
#define pii pair<int, int>
#define MP make_pair
#define ls (i<<1)
#define rs (i<<1|1)
#define md (ll+rr>>1)
#define lson ll, md, ls
#define rson md+1, rr, rs
#define mod 1000000007
#define DEBUG 0
int g[M][5];
int dp[202][202][200];
int ans[202][202];
int tot;
bool mark[200];
int id[N];
map<LL, int> mp;
int get_id(LL st) {
if(!mp.count(st)) mp[st] = tot+&#