欧拉计划第31题
作者:
brivia
,
2024-02-25 16:59:26
,
所有人可见
,
阅读 37
/*
欧拉计划第31题
背包方案数
*/
#include<bits/stdc++.h>
using namespace std;
int main(void)
{
int ans = 0;
for (int i = 0; i <= 1; ++ i) // 200
for (int j = 0; j <= 2; ++ j) // 100
for (int k = 0; k <= 4; ++ k) // 50
for (int a = 0; a <= 10; ++ a) // 20
for (int b = 0; b <= 20; ++ b) // 10
for (int c = 0; c <= 40; ++ c) // 5
for (int d = 0; d <= 100; ++ d) //2
{
if (i * 200 + j * 100 + k * 50 + a * 20 + b * 10 + c * 5 + d * 2 <= 200) ans ++;
}
cout << ans << endl;
return 0;
}