摘要：
详细见：http://blog.csdn.net/nk_test/article/details/46242401 #include<bits/stdc++.h> using namespace std; const int maxn = 1e7; bool vis[maxn]; int prime 阅读全文
摘要：
Two Paths Problem Description You are given a undirected graph with n nodes (numbered from 1 to n) and m edges. Alice and Bob are now trying to play a 阅读全文