题目链接：http://www.lydsy.com/JudgeOnline/problem.php?id=1708
题意：v 种硬币，每种有个价值，求凑够 n 元的方案数
裸完全背包... 日常水题
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 |
#include <cmath> #include <queue> #include <cstdio> #include <iomanip> #include <cstdlib> #include <cstring> #include <iostream> #include <algorithm> #define N 10010 #define ll long long using namespace std; inline int read() { int 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-'0';ch=getchar();} return x*f; } int v,n; ll f[N],tmp; int main() { f[0]=1; v=read(),n=read(); while(v--) { tmp=read(); for(int i=tmp;i<=n;i++) f[i]+=f[i-tmp]; } printf("%lld",f[n]); } |
Comments | NOTHING