zhber
有好多做过的题没写下来,如果我还能记得就补吧
上一页 1 ··· 21 22 23 24 25 26 27 28 29 ··· 34 下一页
摘要: DescriptionBessie was poking around the ant hill one day watching the ants march to and fro while gathering food. She realized that many of the ants w... 阅读全文
posted @ 2014-07-27 22:54 zhber 阅读(170) 评论(0) 推荐(0) 编辑
摘要: Description编号为1到N的N只奶牛正各自驾着车打算在牛德比亚的高速公路上飞驰.高速公路有M(1≤M≤N)条车道.奶牛i有一个自己的车速上限Si(l≤Si≤1,000,000).在经历过糟糕的驾驶事故之后,奶牛们变得十分小心,避免碰撞的发生.每条车道上,如果某一只奶牛i的前面有南只奶牛驾车行... 阅读全文
posted @ 2014-07-27 21:58 zhber 阅读(140) 评论(0) 推荐(0) 编辑
摘要: Description21 世纪,许多人得了一种奇怪的病:起床困难综合症,其临床表现为:起床难,起床后精神不佳。作为一名青春阳光好少年,atm 一直坚持与起床困难综合症作斗争。通过研究相关文献,他找到了该病的发病原因:在深邃的太平洋海底中,出现了一条名为 drd 的巨龙,它掌握着睡眠之精髓,能随意延... 阅读全文
posted @ 2014-07-27 21:29 zhber 阅读(170) 评论(0) 推荐(0) 编辑
摘要: DescriptionBessie has two crisp red apples to deliver to two of her friends in the herd. Of course, she travels the C (1 6-> 7 -> 4* -> 3 -> 2 -> 1* ... 阅读全文
posted @ 2014-07-27 16:45 zhber 阅读(152) 评论(0) 推荐(0) 编辑
摘要: DescriptionFarmer John has returned to the County Fair so he can attend the special events (concerts, rodeos, cooking shows, etc.). He wants to attend... 阅读全文
posted @ 2014-07-26 22:30 zhber 阅读(155) 评论(0) 推荐(0) 编辑
摘要: DescriptionThe cows have been sent on a mission through space to acquire a new milking machine for their barn. They are flying through a cluster of st... 阅读全文
posted @ 2014-07-25 23:08 zhber 阅读(220) 评论(0) 推荐(0) 编辑
摘要: DescriptionLacking even a fifth grade education, the cows are having trouble with a fraction problem from their textbook. Please help them. The proble... 阅读全文
posted @ 2014-07-25 22:45 zhber 阅读(300) 评论(0) 推荐(0) 编辑
摘要: DescriptionThe best part of the day for Farmer John's cows is when the sun sets. They can see the skyline of the distant city. Bessie wonders how many... 阅读全文
posted @ 2014-07-25 22:10 zhber 阅读(189) 评论(0) 推荐(0) 编辑
摘要: Description约翰想要计算他那N(1≤N≤1000)只奶牛的名字的能量.每只奶牛的名字由不超过1000个字待构成,没有一个名字是空字体串,约翰有一张“能量字符串表”,上面有M(1≤M≤100)个代表能量的字符串.每个字符串由不超过30个字体构成,同样不存在空字符串.一个奶牛的名字蕴含多少个能... 阅读全文
posted @ 2014-07-25 21:17 zhber 阅读(435) 评论(0) 推荐(0) 编辑
摘要: DescriptionInput只有一行一个整数 N(0 int n,s;int main(){ scanf("%d",&n); for (int i=1;i<=n;i++) s+=n/i; printf("%d",s);} 阅读全文
posted @ 2014-07-25 16:45 zhber 阅读(127) 评论(0) 推荐(0) 编辑
摘要: Description农夫约翰已经从他的牧场中取得了数不清块数的正方形草皮,草皮的边长总是整数(有时农夫约翰割草皮的刀法不合适,甚至切出了边长为0的正方形草皮),他已经把草皮放在了一个奶牛贝茜已经知道的地方。 贝茜总是希望把美味的草皮放到她的秘密庄园里,她决定从这些草皮中取出恰好4块搬到她的秘密庄园... 阅读全文
posted @ 2014-07-24 23:06 zhber 阅读(212) 评论(0) 推荐(0) 编辑
摘要: DescriptionFarmer John's N (1 #includeusing namespace std;struct cow{ int w,s;}c[50010];int n,ans=-10000000,tot;inline int read(){ int x=0,f=1;char... 阅读全文
posted @ 2014-07-24 22:52 zhber 阅读(125) 评论(0) 推荐(0) 编辑
摘要: DescriptionEver the maturing businessman, Farmer John realizes that he must manage his time effectively. He has N jobs conveniently numbered 1..N (1 #... 阅读全文
posted @ 2014-07-24 21:42 zhber 阅读(148) 评论(0) 推荐(0) 编辑
摘要: DescriptionFarmer John新买的干草打包机的内部结构大概算世界上最混乱的了,它不象普通的机器一样有明确的内部传动装置,而是,N (2 struct point{ int x,y,r; double v;}p[10001];int n,cnt,t,w=1,start,end;int ... 阅读全文
posted @ 2014-07-24 21:29 zhber 阅读(283) 评论(0) 推荐(0) 编辑
摘要: Description贝茜在和约翰玩一个“捉迷藏”的游戏.她正要找出所有适合她躲藏的安全牛棚.一共有N(2≤N≤20000)个牛棚,被编为1到N号.她知道约翰(捉牛者)从牛棚1出发.所有的牛棚由M(1≤M≤50000)条双向路连接,每条双向路连接两个不同的牛棚.所有的牛棚都是相通的.贝茜认为同牛棚1... 阅读全文
posted @ 2014-07-24 20:26 zhber 阅读(214) 评论(0) 推荐(0) 编辑
上一页 1 ··· 21 22 23 24 25 26 27 28 29 ··· 34 下一页