牛客 拼凑面额

题目链接：https://www.nowcoder.com/questionTerminal/14cf13771cd840849a402b848b5c1c93

题目大意

　　略

分析

　　完全背包模板题，bag[i] 表示容量为 i 的背包，存储正好填满背包的方案种数。

代码如下

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3  
 4 #define INIT() std::ios::sync_with_stdio(false);std::cin.tie(0);
 5 #define Rep(i,n) for (int i = 0; i < (n); ++i)
 6 #define For(i,s,t) for (int i = (s); i <= (t); ++i)
 7 #define rFor(i,t,s) for (int i = (t); i >= (s); --i)
 8 #define ForLL(i, s, t) for (LL i = LL(s); i <= LL(t); ++i)
 9 #define rForLL(i, t, s) for (LL i = LL(t); i >= LL(s); --i)
10 #define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
11 #define rforeach(i,c) for (__typeof(c.rbegin()) i = c.rbegin(); i != c.rend(); ++i)
12  
13 #define pr(x) cout << #x << " = " << x << "  "
14 #define prln(x) cout << #x << " = " << x << endl
15  
16 #define LOWBIT(x) ((x)&(-x))
17  
18 #define ALL(x) x.begin(),x.end()
19 #define INS(x) inserter(x,x.begin())
20  
21 #define ms0(a) memset(a,0,sizeof(a))
22 #define msI(a) memset(a,inf,sizeof(a))
23 #define msM(a) memset(a,-1,sizeof(a))
24 
25 #define MP make_pair
26 #define PB push_back
27 #define ft first
28 #define sd second
29  
30 template<typename T1, typename T2>
31 istream &operator>>(istream &in, pair<T1, T2> &p) {
32     in >> p.first >> p.second;
33     return in;
34 }
35  
36 template<typename T>
37 istream &operator>>(istream &in, vector<T> &v) {
38     for (auto &x: v)
39         in >> x;
40     return in;
41 }
42  
43 template<typename T1, typename T2>
44 ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
45     out << "[" << p.first << ", " << p.second << "]" << "\n";
46     return out;
47 }
48 
49 inline int gc(){
50     static const int BUF = 1e7;
51     static char buf[BUF], *bg = buf + BUF, *ed = bg;
52     
53     if(bg == ed) fread(bg = buf, 1, BUF, stdin);
54     return *bg++;
55 } 
56 
57 inline int ri(){
58     int x = 0, f = 1, c = gc();
59     for(; c<48||c>57; f = c=='-'?-1:f, c=gc());
60     for(; c>47&&c<58; x = x*10 + c - 48, c=gc());
61     return x*f;
62 }
63  
64 typedef long long LL;
65 typedef unsigned long long uLL;
66 typedef pair< double, double > PDD;
67 typedef pair< int, int > PII;
68 typedef pair< string, int > PSI;
69 typedef set< int > SI;
70 typedef vector< int > VI;
71 typedef map< int, int > MII;
72 typedef pair< LL, LL > PLL;
73 typedef vector< LL > VL;
74 typedef vector< VL > VVL;
75 const double EPS = 1e-10;
76 const LL inf = 0x7fffffff;
77 const LL infLL = 0x7fffffffffffffffLL;
78 const LL mod = 1e9 + 7;
79 const int maxN = 1e4 + 7;
80 const LL ONE = 1;
81 const LL evenBits = 0xaaaaaaaaaaaaaaaa;
82 const LL oddBits = 0x5555555555555555;
83 
84 int N; 
85 int c[] = {1, 5, 10, 20, 50, 100}; 
86 LL bag[maxN];
87 
88 int main(){
89     INIT();
90     cin >> N;
91     bag[0] = 1;
92     Rep(i, 6) {
93         For(j, c[i], N) {
94             bag[j] += bag[j - c[i]];
95         }
96     }
97     cout << bag[N] << endl;
98     return 0;
99 }

View Code

 

转载于:https://www.cnblogs.com/zaq19970105/p/10828494.html