2012年10月6日

hdu 1016 Prime Ring Problem（深度优先搜索）

摘要： Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14715Accepted Submission(s): 6720Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of nu 阅读全文

posted @ 2012-10-06 19:47 NewPanderKing 阅读(6755) 评论(1) 推荐(3)

hdu 2616 Kill the monster(stl全排列+暴力)

摘要： Kill the monsterTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 502Accepted Submission(s): 345Problem DescriptionThere is a mountain near yifenfei’s hometown. On the mountain lived a big monster. As a hero in hometown, yifenfei wants to kill it. No 阅读全文

posted @ 2012-10-06 18:40 NewPanderKing 阅读(848) 评论(0) 推荐(0)

hdu 2553 N皇后问题(深度递归搜索)

摘要： N皇后问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3730Accepted Submission(s): 1737Problem Description在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许处在与棋盘边框成45角的斜线上。你的任务是，对于给定的N，求出有多少种合法的放置方法。Input共有若干行，每行一个正整数N≤10，表示棋盘和皇后的数量；如果N=0，表示结束。Outpu 阅读全文

posted @ 2012-10-06 15:36 NewPanderKing 阅读(2601) 评论(0) 推荐(0)

导航