글 읽기 - 링크용

ikbs106 4년 전 0

학교 질문용 링크입니다.

댓글 달지 말아주세요

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
int comparArr(int** arr,int i,int k) {
	int Ra, Rb;
	Ra = _msize(arr[i]);
	Rb = _msize(arr[k]);
	if (Ra != Rb)
		return 0;
	else {
		for (int qwe = 0; qwe < Ra/8; qwe++) {
			if (arr[i][qwe] != arr[k][qwe])
				return 0;
		}

		return 1;

	}


}
int main() {
	int temp;
	int multi;
	scanf("%d", &multi);
	int*** arr;
	int** count;
	count = (int**)malloc(sizeof(int*) * multi);
	//총합계싼
	arr = (int***)malloc(sizeof(int**) * multi);
	int count_star;
	int a, b;
	for (int qwe = 0; qwe < multi; qwe++) {
		scanf("%d", &count_star);
		arr[qwe] = (int**)malloc(sizeof(int*) * count_star);
		for (int k = 0; k < count_star; k++) {
			arr[qwe][k] = (int*)malloc(sizeof(int) * count_star);
		}
		for (int i = 0; i < count_star; i++) {
			for (int k = 0; k < count_star; k++) {
				arr[qwe][i][k] = 0;
			}
			
		}
		for (int i = 0; i < count_star - 1; i++) {
			scanf("%d %d", &a, &b);
			arr[qwe][a][b]++;
			arr[qwe][b][a]++;
		}
		/*//행렬 출력
		for (int i = 0; i < count_star; i++) {
			for (int k = 0; k < count_star; k++) {
				printf("%d ", arr[qwe][i][k]);
			}
			printf("\n");
		}*/
		//상부삼각행렬의 총 합을 더해주면 됨
		count[qwe] = (int*)malloc(sizeof(int) * count_star);
		for (int i = 0; i < count_star; i++) {
			count[qwe][i] = 0;
		}
		for (int q = 0; q < count_star; q++) {
			for (int w = q + 1; w < count_star; w++) {
				count[qwe][q] += arr[qwe][q][w];
			}
		}
		for (int i = 0; i < count_star - 1; i++) {
			for (int k = i+1; k < count_star; k++) {
				if (count[qwe][i] < count[qwe][k]) {
					temp = count[qwe][i];
					count[qwe][i] = count[qwe][k];
					count[qwe][k] = temp;
				}
			}
		}
		/*//카운트 출력
		printf("\n카운트 출력%d:",qwe);
		for (int i = 0; i < count_star; i++) {
			printf(" %d", count[qwe][i]);
		}*/

	}
	
	int* ch;
	ch = malloc(sizeof(int) * multi);
	for (int i = 0; i < multi; i++) {
		ch[i] = 1;
	}
	for (int i = 0; i < multi - 1; i++) {
		if (ch[i] == 0)
			continue;
		else {
			for (int k = i + 1; k < multi; k++) {

				if (comparArr(count,i,k))
					ch[k] = 0;

			}
		}
	}
	int num=0;
	for (int i = 0; i < multi; i++) {
		if (ch[i] != 0)
			num++;
	}
	printf("%d", num);



	return 0;
}