摘要: 二进制相关问题,构造View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>using namespace std;#define LL long long#define maxn 100int n;LL m;char st[maxn];int f[maxn];int g[maxn];bool work(){ memset(f, 0, sizeof(f)); memset(g, 0, si 阅读全文
posted @ 2011-08-28 16:34 undefined2024 阅读(253) 评论(0) 推荐(0)
摘要: 无算法,但有些麻烦View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxl 100#define eps 10E-9char st[maxl];char unit;double fat;double tot;void input(){ int temp; char ch; sscanf(st, "%d%c", &temp, &ch); boo 阅读全文
posted @ 2011-08-28 11:07 undefined2024 阅读(202) 评论(0) 推荐(0)
摘要: 匈牙利算法View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define MAXN 205int uN, vN;bool g[MAXN][MAXN];int xM[MAXN], yM[MAXN];bool chk[MAXN];bool SearchPath(int u){ int v; for ( v= 0; v < vN; v++) if (g[u][v] && !ch 阅读全文
posted @ 2011-08-28 09:49 undefined2024 阅读(181) 评论(0) 推荐(0)