题目大意：有n(n一定是偶数)堆硬币，他们的重量依次是21,22,…,2n。现在需要把他们分成两份，并让这两份硬币总质量之差的绝对值尽可能的小，请找到这个方案并输出质量之差的绝对值作为答案。 分法不难想， 将重量为2n的给第一份，重量为2n-1~2n-n/2-1的部分给第二份，剩下的再分给第一份。 原因很简……
来自分类：做题
你已到达了世界的尽头(｡・`ω´･)！
-
edisoncgh
最近访客
评论
-
于「3年前」在「互换友链」中说:
-
于「3年前」在「互换友链」中说:( ,,´･ω･)ﾉ"(´っω･｀｡)
-
于「3年前」在「poj2524：Ubiquitous Religions」中说:Hello there! This is my 1st comment here so I just wanted to give a quick shout out and say I really enjoy reading through your articles. Can you suggest any other blogs/websites/forums that cover the same subjects? Thank you!
-
于「3年前」在「C++Trie树(字典树)」中说:I wish to point out my passion for your generosity giving support to people who require help with your situation. Your special commitment to passing the solution around appears to be pretty significant and have usually made people like me to get to their aims. The important facts signifies a whole lot a person like me and a whole lot more to my fellow workers. Many thanks; from everyone of us. Frannie Prentiss Langille
-
于「3年前」在「C++Trie树(字典树)」中说:Awesome post. I am a regular visitor of your blog and appreciate you taking the time to maintain the excellent site. I will be a frequent visitor for a long time. Manon Cornie Elwina
-
