From 8d6b76e940550936f36dee3e32bd75ec07697427 Mon Sep 17 00:00:00 2001
From: laura <laura@ccc.ac>
Date: Mon, 8 Dec 2025 22:32:53 +0100
Subject: [PATCH] initialized 2_2 identical to 2

---
 2_2/Makefile |  13 ++++
 2_2/main.c   | 201 +++++++++++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 214 insertions(+)
 create mode 100644 2_2/Makefile
 create mode 100644 2_2/main.c

diff --git a/2_2/Makefile b/2_2/Makefile
new file mode 100644
index 0000000..ba44bd3
--- /dev/null
+++ b/2_2/Makefile
@@ -0,0 +1,13 @@
+client: main.c
+	gcc -o main main.c -O3 -Wall -Wextra -g -march=x86-64-v3
+
+client-debug: main.c
+	gcc -o main main.c -O1 -Wall -Wextra -g -fsanitize=address
+
+client-debug-nosanitize: main.c
+	gcc -o main main.c -O1 -Wall -Wextra -g
+
+clean:
+	rm main
+
+.PHONY: clean
\ No newline at end of file
diff --git a/2_2/main.c b/2_2/main.c
new file mode 100644
index 0000000..d45a6ef
--- /dev/null
+++ b/2_2/main.c
@@ -0,0 +1,201 @@
+#include <stdlib.h>
+#include <stdint.h>
+#include <stdio.h>
+#include <stdbool.h>
+#include <string.h>
+#include <sys/types.h>
+#include <unistd.h>
+#include <time.h>
+#include <limits.h>
+
+char input[] =
+{
+#embed "input.txt"
+,'\0' // null terminator
+};
+
+//char input[] = "L68\nL30\nR48\nL5\nR60\nL55\nL1\nL99\nR14\nL82\n";
+int width = 0;
+int height = 0;
+uint64_t result = 0;
+uint64_t result_2 = 0;
+
+
+uint64_t parseNum(char* str, int* len){
+    int i = 0;
+    uint64_t out = 0;
+    while(str[i] != ',' && str[i] != '-' && str[i] != '\n'){
+        out += str[i]-0x30;
+        out *= 10;
+        i++;
+    }
+    out /=10;
+    *len = i;
+    return out;
+}
+
+int numPlaces (uint64_t n) {
+    int r = 1;
+    while (n > 9) {
+        n /= 10;
+        r++;
+    }
+    //printf("%d has %d places\n", n, r);
+    return r;
+}
+
+uint64_t power(uint64_t base, uint64_t exp) {
+    uint64_t i, result = 1;
+    for (i = 0; i < exp; i++)
+        result *= base;
+    return result;
+ }
+
+bool check_silly(uint64_t in){
+    int num = numPlaces(in);
+    
+    if(!(num%2)){
+        uint64_t div = 1+power(10, num/2);
+        //printf("check dividend is %d\n", div);
+        if(in%div == 0){
+            return true;
+        }
+    }
+    return false;
+}
+
+void sort_ranges(uint64_t* starts, uint64_t* ends, int len){
+    int curr_min = 0;
+    for(int i = 0; i<len-1; i++){
+        for(int o = i; o<len; o++){
+            if(starts[curr_min]>starts[o]){
+                curr_min = o;
+            }
+        }
+        uint64_t tmp_start = starts[curr_min];
+        uint64_t tmp_end = ends[curr_min];
+        
+        starts[curr_min] = starts[i];
+        ends[curr_min] = ends[i];
+
+        starts[i] = tmp_start;
+        ends[i] = tmp_end;
+    }
+}
+
+//splits ranges that go over a decimal overflow barrier into two (or if necessary more) ranges
+void optimize_ranges(uint64_t* starts, uint64_t* ends, int* len){
+    for(int i = 0; i<(*len); i++){
+        if(numPlaces(starts[i])<numPlaces(ends[i])){
+            //printf("Range %lu - %lu crosses barrier\n", starts[i], ends[i]);
+            ends[*len] = ends[i];
+            ends[i] = power(10, numPlaces(starts[i]))-1;
+            starts[*len] = power(10, numPlaces(starts[i]));
+            (*len)++;
+            
+
+            //printf("Split into %lu - %lu\n", starts[i], ends[i]);
+            //printf("and %lu - %lu\n\n", starts[*len], ends[*len]);
+        }
+    }
+
+}
+
+uint64_t sumup(uint64_t a, uint64_t b){
+    uint64_t res = 0;
+    for(uint64_t i = a; i<=b; i++){
+        res += i;
+    }
+    return res;
+}
+
+uint64_t sum_gauss(uint64_t a){
+    return (a*(a+1))/2;
+}
+
+uint64_t sumup_gauss(uint64_t a, uint64_t b){
+    return sum_gauss(b)-sum_gauss(a-1);
+}
+
+uint64_t check_range(uint64_t start, uint64_t end){
+    int num = numPlaces(start);
+    if(!(num%2)){
+        uint64_t div = 1+power(10, num/2);
+        uint64_t a = ((start+div-1)/div);
+        uint64_t b = (end)/div;
+        //uint64_t sum = sumup(a, b);
+        uint64_t sum = sumup_gauss(a, b);
+        //printf("Range %lu - %lu\nsumup: \t%lu\nsumup_gauss: \t%lu\n\n", start, end, sum, sum2);
+
+        return sum*div;
+    }
+    return 0;
+}
+
+int main(int argc, char *argv[]){
+    clock_t start, end;
+    start = clock();
+
+    //printf("INT_MAX: %d\n", INT_MAX);
+
+    int i = 0;
+    int num_ranges = 1;
+    while(input[i] != 0){
+        if(input[i]==','){
+            num_ranges++;
+        }
+        i++;
+    }
+
+    uint64_t starts[num_ranges*2];
+    uint64_t ends[num_ranges*2];
+
+    i = 0;
+    int range_num = 0;
+    int len = 0;
+    while(input[i] != 0){
+        starts[range_num] = parseNum(&input[i], &len);
+        i+=len+1;
+        ends[range_num] = parseNum(&input[i], &len);
+        i+=len+1;
+
+        //printf("%d-%d\n", starts[range_num], ends[range_num]);
+        range_num++;
+    }
+
+
+
+    optimize_ranges(starts, ends, &num_ranges);
+
+    for(i = 0; i<num_ranges; i++){
+        //printf("checking range %lu-%lu\n", starts[i], ends[i]);
+        result_2 += check_range(starts[i], ends[i]);
+        //for(uint64_t o = starts[i]; o<=ends[i]; o++){
+        //    //printf("checking %d for sillyness\n", o);
+        //    if(check_silly(o)){
+        //        result += o;
+        //        //printf("%lu is SILLY!\t\tcount is %lu\n", o, result);
+        //        
+        //    }
+        //}
+        //printf("count: %lu\n", result);
+        //printf("count_2: %lu\n\n", result_2);
+    }
+    
+    //if(check_silly(1212)){
+    //    result += 1212;
+    //    printf("%d is SILLY!\n", 1212);
+    //}
+    
+
+    end = clock();
+    printf("count: %lu\n", result);
+    printf("count_2: %lu\n", result_2);
+    clock_t ticks_taken = end - start; 
+    double time_taken = ((double)ticks_taken)/CLOCKS_PER_SEC;
+    printf("time take: %f ticks\n", time_taken);
+    printf("CLOCKS_PER_SEC: %ld\n", CLOCKS_PER_SEC);
+
+
+    exit(1);
+}
\ No newline at end of file