6-caucsejunseo

caucsejunseo/README.md

@@ -1,10 +1,9 @@
 ## ✏️ 기록   
 
  | 차시 |    날짜    | 문제유형 | 링크 | 풀이 |
- |:----:|:---------:|:----:|:-----:|:----:|
- | 1차시 | 2025.03.18 |  그리디  | [동전0](https://www.acmicpc.net/problem/11047)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/4|
- | 2차시 | 2025.03.22 |   스택   | [단어뒤집기2](https://www.acmicpc.net/problem/17413)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/8|
- | 3차시 | 2025.03.26 |   스택   | [좋은단어](https://www.acmicpc.net/problem/3986)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/12|
- | 4차시 | 2025.03.27 |   스택   | [과제는끝나지않아!](https://www.acmicpc.net/problem/17952)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/14|
- | 5차시 | 2025.04.02 |   큐    |  [요세푸스문제](https://www.acmicpc.net/problem/1158)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/19|
- ---
+ | 1차시 | 2025.03.18 |  그리디  | [동전0](https://www.acmicpc.net/problem/11047)|[#4}]https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/4|
+ | 2차시 | 2025.03.22 |   스택   | [단어뒤집기2](https://www.acmicpc.net/problem/17413)|[#8]https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/8|
+ | 3차시 | 2025.03.26 |   스택   | [좋은단어](https://www.acmicpc.net/problem/3986)|[#12]https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/12|
+ | 4차시 | 2025.03.27 |   스택   | [과제는끝나지않아!](https://www.acmicpc.net/problem/17952)|[#14]https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/14|
+ | 5차시 | 2025.04.02 |   큐    |  [요세푸스문제](https://www.acmicpc.net/problem/1158)|[#19]https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/19|
+ | 6차시 | 2025.04.06 |   큐    | [앵무새](https://www.acmicpc.net/problem/14713)|[#23]https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/23|

caucsejunseo/큐/2025.04.06.앵무새.c

@@ -0,0 +1,112 @@
+#define _CRT_SECURE_NO_WARNINGS
+#include<stdio.h> 
+#include <string.h>
+#include <stdlib.h>
+
+#define MAX_parrot 100
+#define MAX_words 100
+#define WORDLINE 33 
+
+char sentence[350000];
+char line[350000];
+
+typedef struct
+{
+	char words[MAX_words][WORDLINE];
+	int front, rear;
+}Queue;
+
+void initqueue(Queue* q) //Queue* q는 Queue 구조체의 주소를 매개변수로 받겠다는 뜻
+{
+	q->front = q->rear = 0;    // q.front = 0;  직접 구조체일 때는 .
+}                              //qr->front = 0;  포인터일 땐 -> . (*q).front의 줄임표현
+
+void enqueue(Queue* q, char* word)
+{
+	strcpy(q->words[q->rear++], word);
+}
+
+int dequeue(Queue* q, char* buffer)
+{
+	if (q->front < q->rear) {
+		strcpy(buffer, q->words[q->front++]);
+		return 1;
+	}
+	return 0;
+}
+
+int isEmpty(Queue* q) {
+	return q->front == q->rear;
+}
+Queue parrot[MAX_parrot];
+int main()
+
+{
+	int N;
+	scanf("%d\n", &N); //fgets 쓸때 \n처리
+
+
+
+	int i = 0;
+	for (i = 0; i < N; i++)
+	{
+		initqueue(&parrot[i]);
+
+
+
+		fgets(line, sizeof(line), stdin);
+
+		char* token = strtok(line, " \n");//**"단어 전체를 가리키는 포인터"**니까 → char* token
+
+		while (token)
+		{
+			enqueue(&parrot[i], token);
+			token = strtok(NULL, " \n");
+		}
+
+	}
+
+	fgets(sentence, sizeof(sentence), stdin);
+
+	char* token = strtok(sentence, " \n");
+	int success = 1;
+
+	while (token)
+	{
+		int found = 0;
+		for (i = 0; i < N; i++)
+		{
+			if (!isEmpty(&parrot[i]) && strcmp(parrot[i].words[parrot[i].front], token) == 0)
+			{
+				parrot[i].front++;
+				found = 1;
+				break;
+			}
+		}
+		if (!found)
+		{
+			success = 0;
+			break;
+		}
+
+		token = strtok(NULL, " \n");
+
+
+	}
+	if (success) {
+		for (int i = 0; i < N; ++i) {
+			if (!isEmpty(&parrot[i])) {
+				success = 0;
+				break;
+			}
+		}
+	}
+
+	if (success == 1)
+		printf("Possible");
+	else if (success == 0)
+		printf("Impossible");
+
+
+	return 0;
+}