SRM 495

藍色留念...

http://www.topcoder.com/stat?c=round_overview&er=5&rd=14424

Codeforces #57

2010-02-26 Wed
HKG Time - 0000 to 0200

終於... 在一次 individual contest 做到少人完成的難題目了...!

• 題目
• 排名 (12th)
• 官方 Analysis

---

題解概要：

HDU 3748 Equivalent mass

Problem Statement:

• Given N elements, A[N], determine if it is possible to pick exactly K of them s.t. the sum is V. But you cannot pick X^th and Y^th simultaneously, for some given pairs (X, Y). There are M such pairs.

Constraints:

• 1 <= N <= 32
• 1 <= A[i], V <= 10^9
• 0 <= M <= 6
• 0 <= K <= N