diff --git a/kattis/problems/01_12_23/kikiboba/4.in b/kattis/problems/01_12_23/kikiboba/4.in
new file mode 100644
index 0000000..a880fad
--- /dev/null
+++ b/kattis/problems/01_12_23/kikiboba/4.in
@@ -0,0 +1 @@
+ljus
\ No newline at end of file
diff --git a/kattis/problems/01_12_23/kikiboba/main.c b/kattis/problems/01_12_23/kikiboba/main.c
new file mode 100644
index 0000000..5770036
--- /dev/null
+++ b/kattis/problems/01_12_23/kikiboba/main.c
@@ -0,0 +1,26 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+int main(int argc, char **argv) {
+  int b = 0, k = 0;
+  char c;
+  while ((c = getchar()) != EOF) {
+    if (c == 'b') {
+      b++;
+    }
+    if (c == 'k') {
+      k++;
+    }
+
+  }
+  if (b > k) {
+    printf("boba\n");
+  } else if (k > b) {
+    printf("kiki\n");
+  } else if (k == 0 && b == 0) {
+    printf("none\n");
+  } else if (k == b) {
+    printf("boki\n");
+  }
+  return 0;
+}
\ No newline at end of file
diff --git a/kattis/problems/01_12_23/kikiboba/main.c.orig b/kattis/problems/01_12_23/kikiboba/main.c.orig
new file mode 100644
index 0000000..bec4f1a
--- /dev/null
+++ b/kattis/problems/01_12_23/kikiboba/main.c.orig
@@ -0,0 +1,17 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+int main(int argc, char **argv) {
+    int b = 0, k = 0;
+    char c;
+    while ((c = getchar()) != EOF) {
+        if (c == 'b') b++;
+        if (c == 'k') k++;
+        
+    }
+    if (b > k) printf("boba\n");
+    if (k > b) printf("kiki\n");
+    if (k == 0 && b == 0) printf("none\n");
+    if (k == b) printf("boki\n");
+    return 0;
+}
\ No newline at end of file
diff --git a/kattis/problems/01_12_23/kikiboba/program b/kattis/problems/01_12_23/kikiboba/program
new file mode 100755
index 0000000..7f6ad6d
Binary files /dev/null and b/kattis/problems/01_12_23/kikiboba/program differ
diff --git a/kattis/problems/01_12_23/ladder/1.in b/kattis/problems/01_12_23/ladder/1.in
new file mode 100644
index 0000000..2e8e30f
--- /dev/null
+++ b/kattis/problems/01_12_23/ladder/1.in
@@ -0,0 +1 @@
+500 70
\ No newline at end of file
diff --git a/kattis/problems/01_12_23/ladder/main.c b/kattis/problems/01_12_23/ladder/main.c
new file mode 100644
index 0000000..f5ca7f8
--- /dev/null
+++ b/kattis/problems/01_12_23/ladder/main.c
@@ -0,0 +1,15 @@
+#include <stdio.h>
+#include <math.h>
+#define PI 3.14159265358979323846
+
+int main() {
+  int wall_height, max_angle;
+
+  scanf("%d %d", &wall_height, &max_angle);
+  double max_angle_radians = max_angle * PI / 180.0;
+  double ladder_length = wall_height / sin(max_angle_radians);
+  int rounded_length = (int)ceil(ladder_length);
+  printf("%d\n", rounded_length);
+
+  return 0;
+}
diff --git a/kattis/problems/01_12_23/ladder/main.c.orig b/kattis/problems/01_12_23/ladder/main.c.orig
new file mode 100644
index 0000000..45b6f78
--- /dev/null
+++ b/kattis/problems/01_12_23/ladder/main.c.orig
@@ -0,0 +1,23 @@
+#include <stdio.h>
+#include <math.h>
+
+int main() {
+    int wall_height, max_angle;
+    
+    // Input values
+    scanf("%d %d", &wall_height, &max_angle);
+    
+    // Convert max_angle from degrees to radians
+    double max_angle_radians = max_angle * M_PI / 180.0;
+    
+    // Calculate ladder length
+    double ladder_length = wall_height / sin(max_angle_radians);
+    
+    // Round up to the nearest integer
+    int rounded_length = (int)ceil(ladder_length);
+    
+    // Print the result
+    printf("%d\n", rounded_length);
+    
+    return 0;
+}
diff --git a/kattis/problems/01_12_23/ladder/program b/kattis/problems/01_12_23/ladder/program
new file mode 100755
index 0000000..ab9abfc
Binary files /dev/null and b/kattis/problems/01_12_23/ladder/program differ
diff --git a/kattis/problems/01_12_23/stokigalistor.c b/kattis/problems/01_12_23/stokigalistor.c
new file mode 100644
index 0000000..d621d06
--- /dev/null
+++ b/kattis/problems/01_12_23/stokigalistor.c
@@ -0,0 +1,32 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+int cmpfunc(const void *a, const void *b) {
+  return (*(int *)a - *(int *)b);
+}
+int main(int argc, char **argv) {
+  int n;
+  int arr[1000];
+
+  scanf("%d", &n);
+  for (int i = 0; i < n; i++) {
+    scanf("%d", &arr[i]);
+  }
+
+  int sorted[1000];
+  for (int i = 0; i < n; i++) {
+    sorted[i] = arr[i];
+  }
+
+  qsort(sorted, n, sizeof(int), cmpfunc);
+
+  int wrong = 0;
+  for (int i = 0; i < n; i++) {
+    if (arr[i] != sorted[i]) {
+      wrong += 1;
+    }
+  }
+  
+  printf("%d\n", wrong);
+  return 0;
+}
\ No newline at end of file