上一页 1 ··· 3 4 5 6 7 8 9 10 11 ··· 31 下一页
摘要: The city planners plan to build N plants in the city which has M shops. Each shop needs products from some plants to make profit of proiproi units. Bu 阅读全文
posted @ 2017-08-25 10:41 joeylee97 阅读(139) 评论(0) 推荐(0) 编辑
摘要: The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all pl 阅读全文
posted @ 2017-08-25 10:35 joeylee97 阅读(186) 评论(0) 推荐(0) 编辑
摘要: Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star 阅读全文
posted @ 2017-08-25 10:33 joeylee97 阅读(234) 评论(0) 推荐(0) 编辑
摘要: 百度科技园内有nn个零食机,零食机之间通过n−1n−1条路相互连通。每个零食机都有一个值vv,表示为小度熊提供零食的价值。 由于零食被频繁的消耗和补充,零食机的价值vv会时常发生变化。小度熊只能从编号为0的零食机出发,并且每个零食机至多经过一次。另外,小度熊会对某个零食机的零食有所偏爱,要求路线上必 阅读全文
posted @ 2017-08-25 10:14 joeylee97 阅读(249) 评论(0) 推荐(0) 编辑
摘要: 我们称一个长度为2n的数列是有趣的,当且仅当该数列满足以下三个条件: (1)它是从1到2n共2n个整数的一个排列{ai}; (2)所有的奇数项满足a1<a3<…<a2n-1,所有的偶数项满足a2<a4<…<a2n; (3)任意相邻的两项a2i-1与a2i(1≤i≤n)满足奇数项小于偶数项,即:a2i 阅读全文
posted @ 2017-08-25 10:10 joeylee97 阅读(946) 评论(0) 推荐(0) 编辑
摘要: Devu wants to decorate his garden with flowers. He has purchased n boxes, where the i-th box contains fi flowers. All flowers in a single box are of t 阅读全文
posted @ 2017-08-25 10:07 joeylee97 阅读(187) 评论(0) 推荐(0) 编辑
摘要: 任何正整数都能分解成2的幂,给定整数N,求N的此类划分方法的数量!由于方案数量较大,输出Mod 1000000007的结果。 比如N = 7时,共有6种划分方法。 7=1+1+1+1+1+1+1 =1+1+1+1+1+2 =1+1+1+2+2 =1+2+2+2 =1+1+1+4 =1+2+4 Inp 阅读全文
posted @ 2017-08-25 10:05 joeylee97 阅读(573) 评论(0) 推荐(0) 编辑
摘要: 1007: 易碎的鸟蛋 题目描述 你们知道吗?西电的跳楼塔上面有一个鸟巢。某SXBK的教授对这个鸟巢很感兴趣。经过仔细观察,他发现鸟巢中有若干枚蛋。于是他想利用这些蛋做一个试验。测试一下蛋的坚固程度。这些蛋应该是具有相同的坚硬度。存在一个非负整数E,如果从塔的第E层往下扔蛋,蛋不会破,但如果从第E+ 阅读全文
posted @ 2017-08-21 16:00 joeylee97 阅读(190) 评论(0) 推荐(0) 编辑
摘要: The TV shows such as You Are the One has been very popular. In order to meet the need of boys who are still single, TJUT hold the show itself. The sho 阅读全文
posted @ 2017-08-21 13:42 joeylee97 阅读(207) 评论(0) 推荐(0) 编辑
摘要: Help Jimmy" 是在下图所示的场景上完成的游戏。 场景中包括多个长度和高度各不相同的平台。地面是最低的平台,高度为零,长度无限。 Jimmy老鼠在时刻0从高于所有平台的某处开始下落,它的下落速度始终为1米/秒。当Jimmy落到某个平台上时,游戏者选择让它向左还是向右跑,它跑动的速度也是1米/ 阅读全文
posted @ 2017-08-21 13:41 joeylee97 阅读(160) 评论(0) 推荐(0) 编辑
上一页 1 ··· 3 4 5 6 7 8 9 10 11 ··· 31 下一页