A Blog

摘要： 简单并查集View Code #include <iostream>#include <cstdlib>#include <cstdio>#include <cstring>using namespace std;#define maxn 30005int n, m;int father[maxn];int stk[maxn];void init(){ for (int i = 0; i < n; i++) father[i] = i;}int getanc(int a){ int top = 0; while (father[a] != 阅读全文

摘要： 简单模拟View Code //zoj1764#include <iostream>#include <string>using namespace std;int n, winprob, winpoint, nowprob, nowpoint;string winname, nowname;int main(){ int i, a, b, j; // freopen("t.txt", "r", stdin); cin >> n; winprob = -1; for (i = 0; i < n; i++) { . 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdlib>#include <cstdio>#include <cstring>using namespace std;int main(){ //freopen("t.txt", "r", stdin); double n, m; scanf("%lf", &m); while (scanf("%lf", &n), n != 999) { printf(&quo 阅读全文

摘要： 麻烦的字符串处理View Code //zoj1762//注意题意，是按挑战名单的列，逐列进行从上至下的输入#include <iostream>#include <string>using namespace std;const int maxn = 35;int n, fact2[11], roundnum, longest[11], linenum, t;string input[maxn / 2][2];string list[maxn * 4];char output[maxn][maxn * 8];int start... 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdlib>#include <cstdio>#include <cstring>using namespace std;#define maxn 20int n;int f[maxn];void input(){ n = 0; while (scanf("%d", &f[n]), f[n]) { if (f[n] == -1) exit(0); n++; }}void work(){ int ans = 0; for (... 阅读全文