摘要: HDU 2069 Coin Change换零钱, 计算有多少方案数#include #include #include using namespace std;#define N 100010int dp[N], w[5], v[5], n, m;int main(){ w[0] = 1; w... 阅读全文
posted @ 2014-11-22 14:20 豪气干云 阅读(192) 评论(0) 推荐(0)