7-8-File Transfer-编程题

解题代码

#include<stdio.h>
#define MAXN 10000
typedef int set[MAXN];
void Initialization(set S, int N);
void Input_connection(set S);
void Check_connection(set S);
void Check_networks(set S, int N);
int Find(set S, int x);
void Union(set S, int root1, int root2);
int main()
{
	int N, i;
	set S;
	scanf("%d\n", &N);
	Initialization(S,N);
	char in;
	do {
		scanf("%c", &in);
		switch (in)
		{
		case 'I':Input_connection(S); break;
		case 'C':Check_connection(S); break;
		case 'S':Check_networks(S,N); break;
		}
	} while (in != 'S');
	return 0;
}
void Initialization(set S, int N) {
	int i;
	for (i = 0; i < N; i++) S[i] = -1;
}
void Input_connection(set S) {
	int x1, x2, root1, root2;
	scanf("%d %d\n", &x1, &x2);
	root1 = Find(S, x1 - 1);
	root2 = Find(S, x2 - 1);
	if (root1 != root2) Union(S, root1, root2);
}
void Check_connection(set S) {
	int x1, x2, root1, root2;
	scanf("%d %d\n", &x1, &x2);
	root1 = Find(S, x1 - 1);
	root2 = Find(S, x2 - 1);
	if (root1 != root2) printf("no\n");
	else printf("yes\n");
}
void Check_networks(set S, int N) {
	int i, counter = 0;
	for (i = 0; i < N; i++) {
		if (S[i] < 0) counter++;
	}
	if (counter == 1) printf("The network is connected.");
	else printf("There are %d components.",counter);
}
int Find(set S, int x) {
	if (S[x] < 0) return x;
	else return S[x] = Find(S, S[x]);
}
void Union(set S, int root1, int root2) {
	if (root1 == root2) return;
	if (S[root1] < S[root2]) {
		S[root1] += S[root2];
		S[root2] = root1;
	}
	else {
		S[root2] += S[root1];
		S[root1] = root2;
	}
}

测试结果

问题整理

1.基础题。