上一页 1 ··· 7 8 9 10 11 12 13 14 15 ··· 22 下一页
摘要: 1.链接地址:http://poj.org/problem?id=2105http://bailian.openjudge.cn/practice/21052.题目:IP AddressTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 18146Accepted: 10456DescriptionSuppose you are reading byte streams from any device, representing IP addresses. Your task is to convert a 32 character 阅读全文
posted @ 2014-03-06 15:12 mobileliker 阅读(217) 评论(0) 推荐(0)
摘要: 1.链接地址:http://bailian.openjudge.cn/practice/27862.题目:总Time Limit:3000msMemory Limit:65536kBDescriptionPell数列a1, a2, a3, ...的定义是这样的,a1 = 1, a2 = 2, ... , an = 2 * an − 1 + an - 2 (n > 2)。给出一个正整数k,要求Pell数列的第k项模上32767是多少。Input第1行是测试数据的组数n,后面跟着n行输入。每组测试数据占1行,包括一个正整数k (1 ≤ k 2 #include 3 4 #define MAX 阅读全文
posted @ 2014-03-06 15:06 mobileliker 阅读(535) 评论(0) 推荐(0)
摘要: 1.链接地址:http://bailian.openjudge.cn/practice/2027http://poj.org/problem?id=20272.题目:总Time Limit:1000msMemory Limit:65536kBDescriptionZombies love to eat brains. Yum.InputThe first line contains a single integer n indicating the number of data sets. The following n lines each represent a data set. Eac 阅读全文
posted @ 2014-03-06 14:51 mobileliker 阅读(184) 评论(0) 推荐(0)
摘要: 1.链接地址:http://bailian.openjudge.cn/practice/2773/http://bailian.openjudge.cn/practice/2726/http://bailian.openjudge.cn/practice/2727/2.题目:总Time Limit:1000msMemory Limit:65536kBDescription辰辰是个很有潜能、天资聪颖的孩子,他的梦想是称为世界上最伟大的医师。为此,他想拜附近最有威望的医师为师。医师为了判断他的资质,给他出 了一个难题。医师把他带到个到处都是草药的山洞里对他说:“孩子,这个山洞里有一些不同的草药,采 阅读全文
posted @ 2014-03-06 14:43 mobileliker 阅读(367) 评论(0) 推荐(0)
摘要: 1.链接地址:http://bailian.openjudge.cn/practice/2013http://poj.org/problem?id=20132.题目:Symmetric OrderTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 11793Accepted: 7181DescriptionIn your job at Albatross Circus Management (yes, it's run by a bunch of clowns), you have just finished writing 阅读全文
posted @ 2014-03-06 12:24 mobileliker 阅读(195) 评论(0) 推荐(0)
摘要: 1.链接地址:bailian.openjudge.cn/practice/1088http://poj.org/problem?id=10882.题目:总Time Limit:1000msMemory Limit:65536kBDescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个 区域中最长的滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 516 17 18 19 615 24 25 20 714... 阅读全文
posted @ 2014-03-06 11:24 mobileliker 阅读(247) 评论(0) 推荐(0)
摘要: 1.链接地址:http://bailian.openjudge.cn/practice/2001http://poj.org/problem?id=20012.题目:Shortest PrefixesTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 12208Accepted: 5210DescriptionA prefix of a string is a substring starting at the beginning of the given string. The prefixes of "carbon&q 阅读全文
posted @ 2014-03-04 21:53 mobileliker 阅读(229) 评论(0) 推荐(0)
摘要: 1 cout.setf(ios::fixed);2 cout.precision(2);3 cout << sum << endl; 阅读全文
posted @ 2014-03-04 21:43 mobileliker 阅读(147) 评论(0) 推荐(0)
摘要: 1.链接地址:http://bailian.openjudge.cn/practice/2795/2.题目:总Time Limit:3000msMemory Limit:65536kBDescription某天KID利用飞行器飞到了一个金银岛上,上面有许多珍贵的金属,KID虽然更喜欢各种宝石的艺术品,可是也不拒绝这样珍贵的金属。但是他只带着一个口袋,口袋至多只能装重量为w的物品。岛上金属有s个种类, 每种金属重量不同,分别为n1, n2, ... , ns,同时每个种类的金属总的价值也不同,分别为v1,v2, ..., vs。KID想一次带走价值尽可能多的金属,问他最多能带走价值多少的金属。注 阅读全文
posted @ 2014-03-04 21:42 mobileliker 阅读(444) 评论(0) 推荐(0)
摘要: 1.链接地址:http://bailian.openjudge.cn/practice/2000http://poj.org/problem?id=20002.题目:总Time Limit:1000msMemory Limit:65536kBDescriptionThe king pays his loyal knight in gold coins. On the first day of his service, the knight receives one gold coin. On each of the next two days (the second and third day 阅读全文
posted @ 2014-03-02 22:20 mobileliker 阅读(206) 评论(0) 推荐(0)
上一页 1 ··· 7 8 9 10 11 12 13 14 15 ··· 22 下一页