码代码的猿猿

2013年9月13日

摘要： Cash MachineTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 24213Accepted: 8476DescriptionA Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ b... 阅读全文

posted @ 2013-09-13 23:08 码代码的猿猿阅读(222) 评论(0) 推荐(0) 编辑

POJ 1837 Balance

摘要： BalanceTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 9240Accepted: 5670DescriptionGigel has a strange "balance" and he wants to poise it. Actually, the device is different from any other or... 阅读全文

posted @ 2013-09-13 21:51 码代码的猿猿阅读(151) 评论(0) 推荐(0) 编辑

POJ 3537 Crosses and Crosses

摘要： Crosses and CrossesTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 2237Accepted: 821Case Time Limit: 2000MSDescriptionThe game of Crosses and Crosses is played on the field of 1 × n cells. Tw... 阅读全文

posted @ 2013-09-13 07:40 码代码的猿猿阅读(221) 评论(0) 推荐(0) 编辑

HDOJ 1524 A Chess Game

摘要： A Chess GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1123 Accepted Submission(s): 519Problem DescriptionLet's design a new chess game.... 阅读全文

posted @ 2013-09-13 06:41 码代码的猿猿阅读(253) 评论(0) 推荐(0) 编辑

HDOJ 1907 John

摘要：对于任意一个 Anti-SG 游戏，如果我们规定当局面中所有的单一游戏的 SG 值为 0 时，游戏结束，则先手必胜当且仅当：（1）游戏的 SG 函数不为 0 且游戏中某个单一游戏的 SG 函数大于 1；（2）游戏的 SG 函数为 0 且游戏中没有单一游戏的 SG 函数大于 1。JohnTime Limit: 5000/1000 MS (Java/Others) Memory Limit: ... 阅读全文

posted @ 2013-09-13 04:44 码代码的猿猿阅读(162) 评论(0) 推荐(1) 编辑

HDOJ 1848 Fibonacci again and again

摘要： Fibonacci again and againTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3610 Accepted Submission(s): 1491Problem Description任何一个大学生对菲波那契数列(F... 阅读全文

posted @ 2013-09-13 01:29 码代码的猿猿阅读(197) 评论(0) 推荐(0) 编辑

HDOJ 1536 S-Nim

摘要： S-NimTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3514 Accepted Submission(s): 1544Problem DescriptionArthur and his sister Caroll have be... 阅读全文

posted @ 2013-09-13 00:26 码代码的猿猿阅读(161) 评论(0) 推荐(0) 编辑

2013年9月11日

POJ 2513 Colored Sticks

摘要： Colored SticksTime Limit:5000MSMemory Limit:128000KTotal Submissions:28036Accepted:7428DescriptionYou are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to align the sticks in a straight line such that the colors of the endpoints that touch are 阅读全文

posted @ 2013-09-11 17:22 码代码的猿猿阅读(236) 评论(0) 推荐(0) 编辑

POJ 2151 Check the difficulty of problems

摘要： Check the difficulty of problemsTime Limit:2000MSMemory Limit:65536KTotal Submissions:4011Accepted:1779DescriptionOrganizing a programming contest is not an easy job. To avoid making the problems too difficult, the organizer usually expect the contest result satisfy the following two terms:1. All of 阅读全文

posted @ 2013-09-11 10:30 码代码的猿猿阅读(186) 评论(0) 推荐(0) 编辑

POJ 2442 Sequence

摘要： Pro. 1 给定k个有序表，取其中前n小的数字。组成一个新表，求该表？算法：由于 a1[1] #include#include#include#includeusingnamespacestd;intt,n,m,A[2222],Q[2222];structnode{intarr,id;booloperatorb.arr;}};intmatrix[2222][2222];voidfuuuuuc(){intcur=0;intnowfrom[2222];memset(nowfrom,0,sizeof(nowfrom));priority_queueq;for(inti=0;i:"&l 阅读全文

posted @ 2013-09-11 10:29 码代码的猿猿阅读(153) 评论(0) 推荐(0) 编辑

码代码的猿猿

公告