Chook_lxk的博客

点击打开题目链接 Problem Description Yu Zhou likes to playGowith Su Lu. From the historical research, we found that there are much difference on the rules between ancient go and modern go. Here i

点击打开题目链接 A hard Aoshu Problem Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 62768/32768 K (Java/Others) Total Submission(s): 1550Accepted Submission(s): 813 Problem Descrip

点击打开题目链接 题目大意： 给出一个无向图及节点n，求解从节点1 到节点n的所有路径，按字典序从小到大输出。 思路： 先用floyd算法求解连通关系，然后dfs求解。（连通关系也可以用并查集） 附上AC代码： #include #include using namespace std; int _map[25][25],path[25],used[25]; int n,u,v; i

点击打开题目链接 Curling 2.0 Time Limit:1000MS Memory Limit:65536K Total Submissions:21409 Accepted:8726 Description On Planet MM-21, after their Olympic gam

题目： 给定一个具有n个顶点的图，要给图上每个顶点染色，并且要使相邻的顶点颜色不同。问是否能最多用2种颜色进行染色？题目保证没有重边和自环。 限制条件：1 input: 3 3（顶点数 边数） 0 1（有一条0到1的边） 0 2（有一条0到2的边） 1 2（有一条1到2的边） output: no 先用邻接表将点之间的关系存储下来，然后依次搜索每一个顶点，依次确定相邻顶点的颜色

点击打开题目链接 John's trip Time Limit:1000MS Memory Limit:65536K Total Submissions:8998 Accepted:3018 Special Judge Description Little Johnny has got a

点击打开题目链接 DeBruijin Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 855Accepted Submission(s): 486 Problem Description 旋转鼓的

点击打开题目链接 Watchcow Time Limit:3000MS Memory Limit:65536K Total Submissions:7926 Accepted:3462 Special Judge Description Bessie's been appointed th

点击打开题目链接 Catenyms Time Limit:1000MS Memory Limit:65536K Total Submissions:12004 Accepted:3116 Description A catenym is a pair of words separated by a

点击打开题目链接 Sticks DescriptionGeorge took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgo

点击打开题目链接 B. Personal programming language time limit per test 1.0 s memory limit per test 64 MB input standard input output standard output Everybody knows that you