BZOJ 1708 [Usaco2007 Oct]Money 奶牛的硬币

题目链接：http://www.lydsy.com/JudgeOnline/problem.php?id=1708

题意：v 种硬币，每种有个价值，求凑够 n 元的方案数

裸完全背包... 日常水题

#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]);
}

#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]);

}

zgz233

zgz233

BZOJ 1708 [Usaco2007 Oct]Money 奶牛的硬币

l1ll5

Comments | NOTHING