C++博客-goal00001111-最新评论http://www.cppblog.com/goal00001111/CommentsRSS.aspx理想，你是不是太遥远zh-cnThu, 20 May 2010 07:37:24 GMTThu, 20 May 2010 07:37:24 GMTcnblogsre: 我解百度之星题目之&quot; 饭团的烦恼 &quot; [未登录]http://www.cppblog.com/goal00001111/archive/2010/02/12/7869.html#107738leoleoFri, 12 Feb 2010 02:47:00 GMThttp://www.cppblog.com/goal00001111/archive/2010/02/12/7869.html#107738#include <stdio.h>
#include <string.h>
#include <math.h>

const int N = 17;

int main() {
int i, a, b, c, d, x, best = -10000, rec = -1, nc, need, np, hun[N], la[N], su[N], dan[N], p[N], sum[4];
char name[N][100];
scanf("%d %d %d", &nc, &need, &np);
for(i = 0; i < nc; i++) {
scanf("%s %d %d %d", &name[i], &p[i], &hun[i], &la[i]);
su[i] = 1-hun[i]; dan[i] = 1-la[i];
}
scanf("%d %d %d %d", &a, &b, &c, &d);
for(x = 0; x < (1<<nc); ++x) {
memset(sum, 0, sizeof(sum));
int price = 0, cnt = 0;
for(i = 0; i < nc; ++i)
if( (x & (1<<i)) != 0) {
cnt++; price += p[i];
}



if(cnt != need || abs(price - np * 15) >= abs(best - np * 15)) continue;
for(i = 0; i < nc; ++i)
if( (x & (1<<i)) != 0)
{
sum[0] += hun[i]; sum[1] += su[i];
sum[2] += la[i]; sum[3] += dan[i];
}

if(sum[0] == a && sum[1] == b && sum[2] == c && sum[3] == d) {
best = price; rec = x;
}
}
for(i = 0; i < nc; i++)
if( (rec & (1<<i)) != 0)
puts(name[i]);
printf("%.2lf\n", 0.8* best / np);
return 0;
}




leo 2010-02-12 10:47 发表评论
]]>re: 我所理解的KMP算法http://www.cppblog.com/goal00001111/archive/2010/01/30/82514.html#106775刘原英（liuyuanying0@gmail.com)刘原英（liuyuanying0@gmail.com)Fri, 29 Jan 2010 23:40:00 GMThttp://www.cppblog.com/goal00001111/archive/2010/01/30/82514.html#106775这篇文章中，18次用到“失配函数”这个词，我一直想弄明白这个函数的概念，因为一般的数学书中没有这个概念，看到您这篇文章，我想找到了指导老师。请帮忙讲一下，什么是失配函数？或者写一篇这样的博客让我们这些不了解的人拜读。当然要先谢谢了。

刘原英（liuyuanying0@gmail.com) 2010-01-30 07:40 发表评论
]]>re: 爱因斯坦的思考题http://www.cppblog.com/goal00001111/archive/2009/12/25/16070.html#104004黄色黄色Thu, 24 Dec 2009 17:24:00 GMThttp://www.cppblog.com/goal00001111/archive/2009/12/25/16070.html#104004

黄色 2009-12-25 01:24 发表评论
]]>re: 非有序全排列生成算法http://www.cppblog.com/goal00001111/archive/2009/12/09/72378.html#102862LostCanvasLostCanvasWed, 09 Dec 2009 12:47:00 GMThttp://www.cppblog.com/goal00001111/archive/2009/12/09/72378.html#102862

LostCanvas 2009-12-09 20:47 发表评论
]]>re: 非有序全排列生成算法[未登录]http://www.cppblog.com/goal00001111/archive/2009/12/05/72378.html#102615starstarSat, 05 Dec 2009 11:01:00 GMThttp://www.cppblog.com/goal00001111/archive/2009/12/05/72378.html#102615近几天在研究全排列的问题，这文章对我有很大帮助哦！

star 2009-12-05 19:01 发表评论
]]>re: 我解百度之星题目之&quot; 饭团的烦恼 &quot; http://www.cppblog.com/goal00001111/archive/2009/11/19/7869.html#101415crazycrazyThu, 19 Nov 2009 13:56:00 GMThttp://www.cppblog.com/goal00001111/archive/2009/11/19/7869.html#101415

crazy 2009-11-19 21:56 发表评论
]]>re: 我所理解的归并排序算法(新)http://www.cppblog.com/goal00001111/archive/2009/10/20/87131.html#99010notmenotmeTue, 20 Oct 2009 03:06:00 GMThttp://www.cppblog.com/goal00001111/archive/2009/10/20/87131.html#99010

notme 2009-10-20 11:06 发表评论
]]>re: 爱因斯坦的思考题http://www.cppblog.com/goal00001111/archive/2009/09/08/16070.html#95522啦啦啦啦啦啦Mon, 07 Sep 2009 21:34:00 GMThttp://www.cppblog.com/goal00001111/archive/2009/09/08/16070.html#95522黄色 蓝色 红色 绿色 白色
挪威 丹麦 英国 德国 瑞典
矿泉水 茶 牛奶 咖啡 啤酒
Dun. Ble. Pal. Pri. Blu.
猫 马 鸟 鱼 狗

啦啦啦 2009-09-08 05:34 发表评论
]]>re: 我所理解的归并排序算法(新)[未登录]http://www.cppblog.com/goal00001111/archive/2009/08/05/87131.html#9230611Wed, 05 Aug 2009 08:57:00 GMThttp://www.cppblog.com/goal00001111/archive/2009/08/05/87131.html#92306

1 2009-08-05 16:57 发表评论
]]>re: 我解百度之星题目之&quot; 座位调整 &quot;http://www.cppblog.com/goal00001111/archive/2009/06/15/7871.html#87752kuramawzwkuramawzwMon, 15 Jun 2009 15:51:00 GMThttp://www.cppblog.com/goal00001111/archive/2009/06/15/7871.html#87752

kuramawzw 2009-06-15 23:51 发表评论
]]>