done with recreio and stack_of_lists

Author: mantertius

recreio.c

@@ -0,0 +1,108 @@
+#include <stdio.h>
+#include <string.h>
+#include <math.h>
+#include <stdlib.h>
+#define DEBUG if(0)
+//https://thehuxley.com/problem/414/code-editor/?quizId=6124
+typedef struct _node
+{
+    int person;
+    int priority;
+    struct _node* next;
+}node;
+typedef struct queue
+{
+    int size;
+    node* head;
+}Q;
+Q* initQ(){
+    Q* new_q = (Q*) malloc(sizeof(Q));
+    new_q->size = 0;
+    new_q->head = NULL;
+    return new_q;
+}
+int isEmpty(Q* q)
+{
+    return (q->head == NULL);
+}
+void priorityEnqueue(Q* q, int person, int priority)
+{
+    node* newT = (node*) malloc(sizeof(node));
+    newT->person = person;
+    newT->priority = priority;
+    if ((isEmpty(q)) || (priority > q->head->priority))
+    {
+        newT->next = q->head;
+        q->head = newT;
+        //printf("primeiro caso\n");
+    }
+    else
+    {
+        node* tmp = q->head;
+        while ((tmp->next != NULL) && (tmp->next->priority >= priority))
+        {
+            tmp = tmp->next;    
+        }
+        newT->next = tmp->next;
+        tmp->next = newT;
+    }
+    //printf("pessoa: [%d] | prioridade [%d]\n",person,priority);
+}
+void printer(Q* q)
+{
+    node* tmp = q->head;
+    while (tmp != NULL)
+    {
+        printf("[%d,%d]→",tmp->priority,tmp->person);
+        tmp = tmp->next;
+    } 
+}
+void flusher(Q* q)
+{
+    while (q->head != NULL)
+    {
+        node* current = q->head->next;
+        free(q->head);
+        q->head = current;
+    }
+    
+}
+int comp(Q* q, int n[], int size)
+{
+    //printf("começo da comp\n");
+    int ans = 0;
+    int i = 0;
+    node* tmp = q->head;
+    while (tmp != NULL && i<size)
+    {
+        if (tmp->person == i)
+        {
+            //printf("[%d] != [%d]\n", tmp->person, i);
+            ans++;
+        } 
+        i++;
+        tmp = tmp->next;
+    }
+    return ans;
+}
+int main() {
+    int cases,du,zi;
+    scanf("%d",&cases); //gets the number of tests
+    Q* q = initQ();
+    for (int i = 0; i < cases ; i++)
+    {
+        scanf("%d",&zi); //number of students
+        int input[zi];   
+        for (int i = 0; i < zi; i++)
+        {
+            scanf("%d",&input[i]);
+            priorityEnqueue(q,i,input[i]);
+            DEBUG printer(q);
+            DEBUG printf("\n");
+        } 
+        du = comp(q,input,zi);
+        printf("%d\n",du);
+        flusher(q);
+    }
+	return 0;
+}

stack_of_lists.c

@@ -0,0 +1,102 @@
+#include <stdio.h>
+#include <string.h>
+#include <math.h>
+#include <stdlib.h>
+#define MAX_LENGHT 100011
+#define DEBUG if(0)
+//https://thehuxley.com/problem/548/code-editor/?quizId=6124
+typedef struct _node
+{
+    char data[MAX_LENGHT];
+    struct _node* next;
+}node;
+
+typedef struct _stack
+{
+    node* top;
+}stack;
+
+stack* init()
+{
+    stack* tito = (stack*) malloc(sizeof(stack));
+    tito->top = NULL;
+    return tito;
+}
+void push(stack* stack, char data[])
+{
+    node* new_node = (node*) malloc (sizeof(node));
+    strcpy(new_node->data,data);
+    new_node->next = stack->top;
+    stack->top = new_node;
+
+}
+void pop(stack* stack)
+{
+    if(stack->top == NULL){printf("EMPTY STACK\n"); return;}
+    node* tmp = stack->top->next;
+    DEBUG printf("next = [%p]",tmp);
+    printf("%s", stack->top->data);
+    free(stack->top);
+    stack->top = tmp;
+
+}
+int main() {
+    
+    stack* pile = init();
+    char input[MAX_LENGHT];
+    strcmp("PUSH",input);
+    char* flag;
+    do
+    {
+        flag = fgets(input,MAX_LENGHT,stdin);
+        DEBUG printf("%s",input);
+        //fflush(stdin);
+        //int len = strlen(input);
+        //if(input[len] != '\n') strcat(input,"\n");
+        if (!(strcmp("PUSH\n",input)))
+        {
+            DEBUG printf("entrou aqui\n");
+            fgets(input,MAX_LENGHT,stdin);
+            push(pile,input);
+            fflush(stdin);
+        }
+        else if ((!(strcmp("POP\n",input)))) // || (!(strcmp("POP",input)))
+        {
+            DEBUG printf("entrou ali\n");
+            pop(pile);
+            
+        }
+        if (!(strcmp("POP",input)))
+        {
+            //printf("blue\n");
+            pop(pile);
+            break;
+        }
+        if (!(strcmp("PUSH",input)))
+        {
+            //printf("ueeasdasgg\n");
+
+            fgets(input,MAX_LENGHT,stdin);
+            push(pile,input);
+            break;
+        }
+        
+    } while (flag != NULL);
+    
+
+	return 0;
+}
+
+// PUSH
+// 5 2 2 2 3 1
+// PUSH
+// 1 2 3
+// PUSH
+// 9 8 7 6 5 4 3 2 1
+// POP
+// POP
+// PUSH
+// 0 0 0 0 0 1
+// PUSH
+// 10 22 11 4 2 3
+// POP

test.c

@@ -2,13 +2,13 @@
 #include <string.h>
 #include <math.h>
 #include <stdlib.h>
+#include <time.h>
 
 int main() {
-    for (int i = 0; i < 41; i++)
+    srand(time(NULL));
+    for (int i = 0; i < 30; i++)
     {
-        printf("%d\n",i);
+        printf("%d ",rand()%1000);
     }
-    
-
 	return 0;
 }