寒山小妖的博客

部分和问题 题目：给定整数a1,a2,...,an,判断是否可以从中选出若干个数，使他们的和恰好为k。 限定条件：1 输入： 4 1 2 4 7 13 4 1 2 4 7 15 输出： Yes No //解法一：这段代码是我根据01背包的思想做的，我把问题看成是容量为k的背包，有n件体积和价值都为a[i]的物品，求出背包能装的最大价值，如果最大价值正好等于背包容量，也就是

Common Subsequence Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%lld & %llu Description A subsequence of a given sequence is the given sequence with some elements (possible

免费馅饼 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)  Total Submission(s): 12017 Accepted Submission(s): 3997 Description  都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉

Charm Bracelet Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu Description Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd

The Triangle Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%lld & %llu Description 7       3   8     8   1   0   2   7   4   4 4   5   2   6   5 (Figure 1) Figure 1 s

Filthy Rich Problem Description They say that in Phrygia, the streets are paved with gold. You’re currently on vacation in Phrygia, and to your astonishment you discover that this is to be taken