글 읽기 - 컴파일 에러가 뜨는 이유가 뭘까요?

wow056 5년 전 0

함수 프로토타입 부분에서 구문 에러가 뜨네요...

뭐가 문제일까요.....?

#include <stdio.h>
#include <stdlib.h>

void init(LIST *plist);
void show(const LIST *plist);
void add(LIST *plist, STUDENT data);
void del(LIST *plist);
void swap(NODE *a, NODE *b);
STUDENT pop(LIST *plist);
void remove_node(NODE *ptr, LIST *plist);
void insert(LIST *plist, NODE *destination, NODE *pick);
void insertion_sort(LIST *plist);
void read_file(LIST *plist, FILE *f);

typedef struct student {
	char name[20];
	char gender;
	int height; //positive intege[cm]
	int score;
	char email[30]; //identifier
} STUDENT;

typedef struct node {
	struct node *prev;
	struct student data;
	struct node *next;
} NODE;

typedef struct list {
	NODE *head;
	int count;
} LIST;

int main(int argc, char *argv[]) {
	FILE *f;
	LIST list;

	if (argc == 1) {
		f = fopen("student.txt", "r");
	}
	else {
		f = fopen(argv[1], "r");
	}
	if (f == NULL) {
		printf("Could not open input file!");
		return -1;
	}

	read_file(&list, f);
	show(&list);
}

void init(LIST *plist) {
	plist->head = NULL;
	plist->count = 0;
}

void show(const LIST *plist) {
	NODE *ptr;
	printf("NAME\t\tGender\tHeight\tEmail\n");
	for (ptr = plist->head; ptr != NULL; ptr = ptr->next)
		printf("%s\t\t%c\t%d\t%s\n", ptr->data.name, ptr->data.gender, ptr->data.height, ptr->data.email);
}

void add(LIST *plist, STUDENT data) {
	NODE *temp;
	temp = (NODE*)malloc(sizeof(NODE));
	temp->prev = NULL;
	temp->data = data;
	temp->next = plist->head;
	plist->head->prev = temp;
	plist->head = temp;
	plist->count++;
}

void remove_node(NODE *ptr, LIST *plist) {
	if (ptr == plist->head) {
		del(plist);
	}
	else {
		ptr->prev->next = ptr->next;
		ptr->next->prev = ptr->prev;
		free(ptr);
		plist->count--;
	}
}

void del(LIST *plist) {
	NODE *temp;
	temp = plist->head;
	plist->head = temp->next;
	plist->head->prev = NULL;
	plist->count--;
	free(temp);
}

void swap(NODE *a, NODE *b) {
	STUDENT temp;
	temp = a->data;
	a->data = b->data;
	b->data = temp;
}

void insert(LIST *plist, NODE *destination, NODE *pick) {
	if (pick == destination) {//1. when pick is destination
		return;
	}
	else if (pick->next == destination) {//2. When destination is next to pick
		return;
	}
	else if (pick == plist->head) {//3. When pick is head of list
		plist->head = pick->next;
		plist->head->prev = NULL;//picking

		pick->next = destination;
		pick->prev = destination->prev;//changing pointer in pick

		destination->prev->next = pick;
		destination->prev = pick;//inserting
	}
	else if (pick->next == NULL) {//4. When pick is tail of list
		pick->prev->next = pick->next;//picking

		pick->next = destination;
		pick->prev = destination->prev;//changing pointer in pick
		if (destination == plist->head) {
			plist->head = pick;
			destination->prev = pick;//inserting
		}
		else {
			destination->prev->next = pick;
			destination->prev = pick;//inserting
		}
	}
	else {//5. else
		pick->prev->next = pick->next;
		pick->next->prev = pick->prev;//picking

		pick->next = destination;
		pick->prev = destination->prev;//changing pointer in pick
		if (destination == plist->head) {
			plist->head = pick;
			destination->prev = pick;//inserting
		}
		else {
			destination->prev->next = pick;
			destination->prev = pick;//inserting
		}
	}
}

void insertion_sort(LIST *plist) {
	NODE *ptr, *pick;
	for (pick = plist->head; pick != NULL; pick = ptr->next) {
		for (ptr = plist->head; ptr != pick; ptr = ptr->next) {
			if (pick->data.height > ptr->data.height) {
				insert(plist, ptr, pick);
			}
		}
	}
}

STUDENT pop(LIST *plist) {
	STUDENT temp;
	temp = plist->head->data;
	del(plist);
	return temp;
}

void sort(LIST *plist) {
	LIST m_list, f_list;
	STUDENT temp;
	int i, n;

	init(&m_list);
	init(&f_list);

	while (plist->head != NULL) {
		temp = pop(plist);
		if (temp.gender == 'm') {
			add(&m_list, temp);
		}
		else if (temp.gender == 'f') {
			add(&f_list, temp);
		}
	}

	insertion_sort(&m_list);
	insertion_sort(&f_list);

	if (m_list.count > f_list.count) {
		while (m_list.count == f_list.count) {
			add(plist, pop(&m_list));
		}
	}
	else if (m_list.count < f_list.count) {
		while (m_list.count == f_list.count) {
			add(plist, pop(&f_list));
		}
	}

	if (m_list.head->data.height >= f_list.head->data.height) {
		n = m_list.count;
		for (i = 0; i < n; i++) {
			add(plist, pop(&m_list));
			add(plist, pop(&f_list));
		}
	}
	else {
		n = m_list.count;
		for (i = 0; i < n; i++) {
			add(plist, pop(&f_list));
			add(plist, pop(&m_list));
		}
	}
}

khy0419 5년 전 1

STUDENT pop(LIST *plist); 선언이 STDENT 구조체 선언문 보다 앞서 있어서 그럴꺼 같네요

djm03178 5년 전 1

어느 부분에서 났는지만 보지 말고, 그 내용을 읽고 원인을 추측해보세요.

댓글을 작성하려면 로그인해야 합니다.

문제

문제

출처

ICPC

컴파일 에러가 뜨는 이유가 뭘까요?

wow056 5년 전 0

khy0419 5년 전 1

djm03178 5년 전 1

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말