나만의 깍두기판

1. 문제https://www.acmicpc.net/problem/9506  2. 풀이#include #include #define SIZE 1000typedef struct{ int data[SIZE]; int front, rear;} QueueType;void init(QueueType *Q){ Q->front = Q->rear = -1;}int isEmpty(QueueType *Q){ return Q->front == Q->rear;}int isFull(QueueType *Q){ return Q->rear == SIZE-1;}void enqueue(QueueType *Q, int e){ if(!isFull(Q)){ Q->rear++; Q->d..

1. 문제https://www.acmicpc.net/problem/5086 2. 풀이#include int main(void){ int tests[10001][2]; int results[10001]; int count = 0; int flag = 0; char factor[] = "factor\0"; char multiple[] = "multiple\0"; char neither[] = "neither\0"; while(1){ scanf("%d %d", &tests[count][0], &tests[count][1]); if(!tests[count][0] && !tests[count][1]){ results[count..