| # | Problem | Pass Rate (passed user / total user) |
|---|---|---|
| 14203 | PME_final-1_20240110 |
|
| 14204 | PME_final-2_20240110 |
|
| 14205 | PME_final-3_20240110 |
|
| 14206 | PME_final-4_20240110 |
|
| 14207 | PME_final-5_20240110 |
|
Description
#include <stdio.h>
#include <stdlib.h>
typedef struct node {
int id;
int grade;
struct node *next;
}NODE;
typedef struct queue {
NODE *front;
}QQ;
void enqueue(QQ *q, int id, int grade) {
NODE *newnode,*tmp;
tmp = q->front;
newnode = malloc(sizeof(NODE));
newnode->id = id;
newnode->grade = grade;
newnode->next = NULL;
while (tmp && tmp->next)
tmp = tmp->next;
if (q->front == NULL)
q->front = newnode;
else
tmp->next = newnode;
return;
}
void display(自行處理) {}
int main() {
char ch[5];
int id, grade, run=1;
QQ *q;
q = (QQ *)malloc(sizeof(QQ));
q->front = NULL;
while(run) {
scanf("%s",ch);
switch (ch[0]){
case 'e':
scanf("%d %d", &id, &grade);
enqueue(q, id, grade);
break;
case 'q':
display(自行處理);
run=0;
break;
default:
continue;
}
}
return 0;
}