摘要：
http://www.lightoj.com/volume_showproblem.php?problem=1027 You are in a maze; seeing n doors in front of you in beginning. You can choose any door you 阅读全文
摘要：
http://www.lightoj.com/volume_showproblem.php?problem=1018 http://www.lightoj.com/volume_showproblem.php?problem=1018 Mubashwir returned home from the 阅读全文
摘要：
C: 最舒适的路线 (并查集) #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; #define INF 20000000 struct point { int 阅读全文
摘要：
http://www.lightoj.com/volume_showproblem.php?problem=1013 http://www.lightoj.com/volume_showproblem.php?problem=1013 Yes, you are developing a 'Love 阅读全文
摘要：
http://www.lightoj.com/volume_showproblem.php?problem=1011 You work in a company which organizes marriages. Marriages are not that easy to be made, so 阅读全文
摘要：
http://www.lightoj.com/volume_showproblem.php?problem=1005 PDF (English) Statistics Forum http://www.lightoj.com/volume_showproblem.php?problem=1005 T 阅读全文
摘要：
A：挑战密室 #include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <cmath> #include <stack> #include <map> #include <vector 阅读全文
摘要：
http://acm.fzu.edu.cn/problem.php?pid=2214 http://acm.fzu.edu.cn/problem.php?pid=2214 Problem Description Given a set of n items, each with a weight w 阅读全文
摘要：
http://acm.fzu.edu.cn/problem.php?pid=2225 http://acm.fzu.edu.cn/problem.php?pid=2225 Problem Description 在打败了易基•普罗布朗、诺姆•普罗布朗之后，小茗同学开始挑战哈德•普罗布朗。 一番交战之 阅读全文
摘要：
http://acm.fzu.edu.cn/problem.php?pid=2233 Problem Description 为了帮助柯南回到一米七四，阿笠博士夜以继日地研究APTX4869的解药。他得出了如下结果： 1.解药由n种原料构成； 2.对于两种不同的的原料a,b，它们之间有个影响值f(a 阅读全文