随笔分类 - DFS
摘要:Yi Sima was one of the best counselors of Cao Cao. He likes to play a funny game himself. It looks like the modern Sudoku, but smaller. Actually, Yi S
阅读全文
摘要:Sudoku Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 3015 Accepted Submission(s): 1010 Problem
阅读全文
摘要:Yu Zhou likes to play Go with Su Lu. From the historical research, we found that there are much difference on the rules between ancient go and modern
阅读全文
摘要:#include using namespace std; const int MAX_N = 100; const int MAX_M = 10000; struct edge{ int v,next; }e[MAX_N]; int p[MAX_N],eid; int init(){ memset(p,-1,sizeof(p)); eid = 0; } void insert(int ...
阅读全文
摘要:A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..., xm > another
阅读全文
摘要:来之不易的2017第一发ac http://poj.org/problem?id=2386 Lake Counting Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 31474 Accepted: 15724 Descripti
阅读全文

浙公网安备 33010602011771号