阅读背景:

1.1.2 Greedy Gift Givers

来源:互联网 

A group of NP (2 ≤ NP ≤ 10) uniquely named friends has decided to exchange gifts of money. Each of these friends might or might not give some money to any or all of the other friends. Likewise, each friend might or might not receive money from any or all of the other friends. Your goal in this problem is to deduce how much more money each person gives than they receive.A group of NP (2 ≤ NP ≤ 10) uniquely named frie




你的当前访问异常,请进行认证后继续阅读剩余内容。

分享到: