🎉

Author: pl3onasm

Extra-C/prob03/prob3-2.c

@@ -2,11 +2,12 @@
   file: prob3-2.c
   author: David De Potter
   description: extra, problem 3, maximum path
-  version: 3.2, using functions library and
-    while the time complexity is still in O(n²), the
-    space complexity is now in O(n) instead of O(n²),
-    by using only two rows of size n instead of a
-    2D array of size n²
+  version: 3.2, using clib library 
+    also changed the implementation to use only two
+    rows of size n instead of a 2D array of size n²
+    Time complexity is still O(n²)
+    Space complexity is now O(n) instead of O(n²) of
+    the previous implementation
 */
 
 #include <stdio.h>

Functions/clib/math.c

@@ -22,14 +22,12 @@ int isDivisor(int x, int y) {
 
   // returns the greatest common divisor of a and b
 int GCD(int a, int b) {
-  
   if (b == 0) return a;
   return GCD(b, a % b);
 }
 
   // returns the least common multiple of a and b
 int LCM(int a, int b) {
-  
   return a / GCD(a, b) * b;
 }
 

PF3-3/exam3-2024/problem5/sol5.dfy

@@ -1,7 +1,7 @@
 /* 
   file: sol5.dfy
   author: David De Potter
-  description: 3-3rd exam 2023, solution to problem 5
+  description: 3-3rd exam 2024, solution to problem 5
 */
 
 method problem5(a: array<int>) returns (k: nat)

PF3-3/resit3-2024/problem2/myprogram.c

@@ -0,0 +1,21 @@
+/* 
+  file: myprogram.c
+  author: your name
+  description: 3-3rd resit exam 2024, problem 2,
+    special numbers
+*/
+
+#include <stdio.h>
+#include <stdlib.h>
+
+int main(int argc, char *argv[]) {
+  
+  // your code here
+
+  // to test your code, run the test script in the terminal: 
+  //   $ ../../../ctest.sh myprogram.c
+  // after you made it executable by running: 
+  //   $ chmod +x ../../../ctest.sh (you only need to do this once)
+
+  return 0;
+}

PF3-3/resit3-2024/problem2/prob2.c

@@ -0,0 +1,44 @@
+/* 
+  file: prob2.c
+  author: David De Potter
+  description: 3-3rd resit exam 2024, problem 2,
+    special numbers
+*/
+
+#include <stdio.h>
+#include <stdlib.h>
+
+int isSpecial(int n) {
+  // determines if n is a special number
+  int count = 0;
+  // check number of prime factors up to sqrt(n)
+  for (int i = 2; i * i <= n; i += (i == 2) ? 1 : 2) {
+    while (n % i == 0) {
+      n /= i;     
+      if (++count > 1) 
+        return 0;
+    }
+  }
+  return count;  // 0 if prime, 1 if special
+}
+
+int main(){
+  int m, count = 0, a = 0, b = 0, c = 0;
+
+  (void)! scanf("%d", &m);
+
+  // we check for n, n - 1 and n - 2 for efficiency
+  // so we start at n = 3 and go up to m + 1
+  for (int n = 3; n < m + 2; ++n) {
+    c = b;
+    b = a;
+    a = isSpecial(n);
+
+    if (a && b && c) 
+      ++count;
+  } 
+
+  printf("%d\n", count);
+  return 0;
+}
+

PF3-3/resit3-2024/problem2/tests/1.in

@@ -0,0 +1 @@
+33

PF3-3/resit3-2024/problem2/tests/1.out

@@ -0,0 +1 @@
+0

PF3-3/resit3-2024/problem2/tests/10.in

@@ -0,0 +1 @@
+4532199

PF3-3/resit3-2024/problem2/tests/10.out

@@ -0,0 +1 @@
+7958

PF3-3/resit3-2024/problem2/tests/2.in

@@ -0,0 +1 @@
+34