摘要： View Code /* Name: 简单数学 Copyright: Author: Try86 Date: 15/04/12 22:45 Description: */#include <cstdio>#include <iostream>using namespace std;int main() { double len; while (scanf("%lf", &len), len!=0.00) { double sum = 0; int i; for (i=2; sum<len; ++i) sum += 1.0/i;... 阅读全文

摘要： View Code /* Name: 拓扑排序，判断有向图是否存在回路及自环，并统计每个顶点的前驱点数 Copyright: Author: Try86 Date: 15/04/12 22:25 Description: */#include <queue>#include <cstdio>#include <cstdlib>#include <cstring>#include <iostream>using namespace std;const int N = 10005;int sum, flag;int counts[N];s 阅读全文

摘要： View Code /* Name: 利用拓扑排序过程判断有向图是否有回路及自环 Copyright: Author: Try86 Date: 15/04/12 21:15 Description: */#include <cstdio>#include <cstdlib>#include <cstring>#include <iostream>using namespace std;const int N = 105;int color[N], flag;struct node { int v; node *next; node(int vv, 阅读全文

摘要： View Code /* Name: 最小生成树(kruskal) Copyright: Author: Try86 Date: 15/04/12 08:01 Description: */#include <cstdio>#include <cstdlib>#include <iostream>using namespace std;const int N = 10005;const int M = 50005;int p[N], sum;struct edge { int u; int v; int w;}e[M];int cmp(const void 阅读全文

摘要： /* Name: 判断无向图是否连通+统计顶点的度数 Copyright: Author: Try86 Date: 14/04/12 23:02 Description: 邻接链表存图 */#include <cstdio>#include <cstdlib>#include <cstring>#include <iostream>using namespace std;const int N = 105;int deg[N]; //统计顶点的度数 bool map[N][N], color[N];struct node { int v; nod 阅读全文