level 1
抛个暴力破解的砖。我也不懂什么算法美学,做出来就完事了。
price = {2, 4, 7, 5, 6, 10}
Solve[x1 + x2 == 16 && (x1 == 2 || x1 == 4 || x1 == 7 || x1 == 5 || x1 == 6 ||x1 == 10) && (x2 == 2 || x2 == 4 || x2 == 7 || x2 == 5 ||x2 == 6 || x2 == 10) && x1 < x2, {x1, x2}]
Solve[x1 + x2 + x3 == 16 && (x1 == 2 || x1 == 4 || x1 == 7 || x1 == 5 || x1 == 6 ||
x1 == 10) && (x2 == 2 || x2 == 4 || x2 == 7 || x2 == 5 ||
x2 == 6 || x2 == 10) && (x3 == 2 || x3 == 4 || x3 == 7 ||
x3 == 5 || x3 == 6 || x3 == 10) && x1 < x2 < x3, {x1, x2, x3}]
规定{x1,x2,x3}递增是为了避免重选,不是很清楚这道题目能不能买一样的东西,如果有的话把<改成≤。
计算结果:
{2, 4, 7, 5, 6, 10}
{{x1 -> 6, x2 -> 10}}
{{x1 -> 2, x2 -> 4, x3 -> 10}, {x1 -> 4, x2 -> 5, x3 -> 7}}
2019年05月15日 02点05分
