![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM->POJ
Fate_O
Lets go
展开
-
ACM->poj 2195 Going Home
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16177 Accepted: 8275DescriptionOn a grid map there are n little men and n houses. In each unit time, every little原创 2013-11-01 10:34:43 · 465 阅读 · 0 评论 -
poj1463 二分图匹配的最小点覆盖
题意:给一棵树,用最少的点覆盖所有的边。Source CodeProblem: 1463 User: 455707843Memory: 780K Time: 422MSLanguage: G++ Result: AcceptedSource Code#include #include #include using namespace std;const原创 2013-12-01 15:25:51 · 494 阅读 · 0 评论 -
poj1080
#include using namespace std;const int MAXN = 101;int dp[MAXN][MAXN];int score[5][5] ={ 5, -1, -2, -1, -3, -1, 5, -3, -2, -4, -2, -3, 5, -2, -2, -1, -2, -2, 5, -1, -3, -4, -原创 2013-12-01 19:54:29 · 518 阅读 · 0 评论 -
poj1014 dfs
Source CodeProblem: 1014 User: 455707843Memory: 1152K Time: 0MSLanguage: G++ Result: AcceptedSource Code#include using namespace std;const int MAXN = 7;int sum = 0;bool flag;int num[M原创 2013-12-01 16:31:11 · 484 阅读 · 0 评论 -
poj1704
#include #include using namespace std;#define oo (~0U >> 1)#define MAXN 1000 + 10int temp[MAXN];int node[MAXN];void input(){ int n, t, x; cin >> t; while (t--) {原创 2013-12-05 13:25:12 · 548 阅读 · 0 评论 -
poj2975 Nim
Nim博弈,问有多少种胜利的方法,因为答案最多只有n,令ans=a1^a2^...^an,如果需要构造出异或值为0的数,而且由于只能操作一堆石子,所以对于某堆石子ai,现在对于ans^ai,就是除了ai以外其他的石子的异或值,如果ans^aiSource CodeProblem: 2975 User: 455707843Memory: 756K Time: 391MS原创 2013-12-05 12:46:37 · 528 阅读 · 0 评论