+178
day_5/5.c
+178
day_5/5.c
···+for (int i = 0; i<limits_arr_len; i++) { // limit_arr_len will be changing as this goes i have no idea if this is optimal+int repeat = 0; // if a merge happened, we will set repeat to true, and so will run the cycle again to check for new overlaps+// if another entry has one of the ends inside, we set the other end equal to the appropriate value, whichever gives the largest range.+printf("min %lld, max %lld, num: %lld\n",limits_arr[i].min,limits_arr[i].max,(limits_arr[i].max - limits_arr[i].min +1));+// printf("ingridient %lld is fresh in range %lld-%lld\n", ingridient,limits_arr[i].min,limits_arr[i].max);
+1178
day_5/input.txt
+1178
day_5/input.txt
···