摘要:
简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 10bool row[maxn], col[maxn];bool map[maxn][maxn];int ans, n, m;void input(){ char ch; memset(map, 0, sizeof(map)); getchar(); for (int i = 0; i < n; i++) { 阅读全文
posted @ 2011-06-21 21:31
undefined2024
阅读(316)
评论(0)
推荐(0)
摘要:
简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>using namespace std;#define maxn 105#define maxl 10struct Word{ char w[maxl];}word[maxn];bool operator < (const Word &a, const Word &b){ return strcmp(a.w 阅读全文
posted @ 2011-06-21 21:18
undefined2024
阅读(348)
评论(0)
推荐(0)
摘要:
简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 1006struct Edge{ int v, next;}edge[1000005];int name[maxn];int n, ecount, tot, root;int in[maxn];int head[maxn];bool vis[maxn];bool ok;void addedge(int a, int 阅读全文
posted @ 2011-06-21 20:59
undefined2024
阅读(448)
评论(0)
推荐(0)
摘要:
简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;long long com(long long n, long long r){ if (n - r < r) r = n - r; long long i, j, s = 1; for (i = 0, j = 1; i < r; ++i) { s *= (n - i); for (; j <= r && 阅读全文
posted @ 2011-06-21 16:25
undefined2024
阅读(221)
评论(0)
推荐(0)
摘要:
简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;int main(){ //freopen("t.txt", "r", stdin); char ch; bool first = true; while ((ch = getchar()) != EOF) { if (ch == '"') { if (first) { pr 阅读全文
posted @ 2011-06-21 16:04
undefined2024
阅读(230)
评论(0)
推荐(0)