ChiLuManXi

摘要： 哈密顿绕行世界问题Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2077Accepted Submission(s): 1316Problem D... 阅读全文

摘要： Eight IITime Limit: 4000/2000 MS (Java/Others)Memory Limit: 130000/65536 K (Java/Others)Total Submission(s): 1645Accepted Submission(s): 349Problem De... 阅读全文

摘要： EightTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16501Accepted Submission(s): 4542Special Jud... 阅读全文

摘要： SudokuTime Limit: 10000MSMemory Limit: 65536KTotal Submissions: 4628Accepted: 2237DescriptionA Sudoku grid is a 16x16 grid of cells grouped in sixteen... 阅读全文

摘要： #1087 : Hamiltonian Cycle时间限制:10000ms单点时限:1000ms内存限制:256MB描述Given a directed graph containing n vertice (numbered from 1 to n) and m edges. Can you te... 阅读全文

摘要： 精确覆盖问题的定义：给定一个由0-1组成的矩阵，是否能找到一个行的集合，使得集合中每一列都恰好包含一个1例如：如下的矩阵就包含了这样一个集合（第1、4、5行）如何利用给定的矩阵求出相应的行的集合呢？我们采用回溯法矩阵1：先假定选择第1行，如下所示：如上图中所示，红色的那行是选中的一行，这一行中有3个... 阅读全文

摘要： Find a wayTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6645Accepted Submission(s): 2205Problem ... 阅读全文

摘要： 非常可乐Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7535Accepted Submission(s): 3005Problem Descri... 阅读全文

摘要： 迷宫问题Time Limit:1000MSMemory Limit:65536KTotal Submissions:11501Accepted:6870Description定义一个二维数组：int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0,... 阅读全文

摘要： Joe works in a maze. Unfortunately, portions of the maze havecaught on fire, and the owner of the maze neglected to create a fireescape plan. Help Joe... 阅读全文