[2**][구조체] S-마트 고객 전화번호부 저장해서 고객번호 같은 고객 정보 출력

 

입력예시 1

5 KimSooJin 010-1234-5678

ParkGilDong 010-2468-2468

ChungSangChul 010-1230-4567

LeeYoungHee 010-1357-2468

ChoiMyungHee 010-3458-1267 2468

 

출력예시1

2 ParkGilDong 010-2468-2468

4 LeeYoungHee 010-1357-2468

 

 

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

struct customer {
	char id[5];
	char* name;
	char* phone;
};

int main() {
	struct customer *ct;
	int n, cnt = 0;
	char tmp1[51], tmp2[51];
	int len1 = 0, len2 = 0;
	char num[5];

	scanf("%d", &n);
	ct = (struct customer*)malloc(n * sizeof(struct customer));
	if (ct == NULL) {
		printf("Not enough memory!");
		return -1;
	}

	for (int i = 0; i < n; i++) {
		scanf("%s %s", tmp1, tmp2);
		
		len1 = strlen(tmp1);
		len2 = strlen(tmp2);

		(ct+i)->name = (struct customer*)malloc((len1 + 1) * sizeof(struct customer));
		if ((ct + i)->name == NULL) {
			printf("Not enough memory!");
			return -1;
		}
		strcpy((ct + i)->name, tmp1);

		(ct+i)->phone = (struct customer*)malloc((len2 + 1) * sizeof(struct customer));
		if ((ct + i)->phone == NULL) {
			printf("Not enough memory!");
			return -1;
		}
		strcpy((ct + i)->phone, tmp2);
	}

	scanf("%s", num);

	for (int i = 0; i < n; i++) {
		int k = 0;
		int chk = 0;
		int flag = 0;
		for (int j = 9; j <= 12; j++) {
			if ((ct + i)->phone[j] == num[k]) {
				flag++;
				k++;
				chk = i;
			}
		}
		if (flag == 4) {
			printf("%d %s %s\n", chk + 1, (ct + chk)->name, (ct + chk)->phone);
			cnt++;
		}
	}

	if (cnt == 0)
		printf("none");

	return 0;
}

 

 

*고객번호 같은 거 검사할때 뒷자리 네개를 어떻게 하지 애먹었음. 배열표기 써서 한게 위에 코드고 배열표기 안쓰고 다시 해볼거임

 

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

struct customer {
	char id[5];
	char* name;
	char* phone;
};

int main() {
	struct customer *ct;
	int n, cnt = 0;
	char tmp1[51], tmp2[51];
	int len1 = 0, len2 = 0;
	char num[5];

	scanf("%d", &n);
	ct = (struct customer*)malloc(n * sizeof(struct customer));
	if (ct == NULL) {
		printf("Not enough memory!");
		return -1;
	}

	for (int i = 0; i < n; i++) {
		scanf("%s %s", tmp1, tmp2);
		
		len1 = strlen(tmp1);
		len2 = strlen(tmp2);

		(ct+i)->name = (struct customer*)malloc((len1 + 1) * sizeof(struct customer));
		if ((ct + i)->name == NULL) {
			printf("Not enough memory!");
			return -1;
		}
		strcpy((ct + i)->name, tmp1);

		(ct+i)->phone = (struct customer*)malloc((len2 + 1) * sizeof(struct customer));
		if ((ct + i)->phone == NULL) {
			printf("Not enough memory!");
			return -1;
		}
		strcpy((ct + i)->phone, tmp2);
	}

	scanf("%s", num);

	for (int i = 0; i < n; i++) {
		int k = 0;
		int chk = 0;
		int flag = 0;
		for (int j = 9; j <= 12; j++) {
			if (strncmp((ct + i)->phone+9, num, 4)==0) {
				flag++;
				chk = i;
			}
		}
		if (flag == 4) {
			printf("%d %s %s\n", chk + 1, (ct + chk)->name, (ct + chk)->phone);
			cnt++;
		}
	}

	if (cnt == 0)
		printf("none");

	return 0;
}

 

**배열 표기 안쓴게 이거

strncmp 이용해서 strncmp((ct + i)->phone+9, num, 4)==0 이렇게 해주면 9번째 자리부터 검사 가능한.