part 1 working, part 2 brute force up to max int, solution may be over max int

2024-12-17 17:53:21 +01:00
parent cd4ef3ff9d
commit cb4b212ab4
5 changed files with 440 additions and 0 deletions
--- a/2024/17/part1.c
+++ b/2024/17/part1.c
@ -0,0 +1,131 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   part1.c                                            :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: tomoron <tomoron@student.42.fr>            +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2024/07/17 23:03:36 by tomoron           #+#    #+#             */
+/*   Updated: 2024/12/17 17:00:12 by tomoron          ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdint.h>
+#include <math.h>
+#include "libft/libft.h"
+
+static long int get_register(char *str)
+{
+	while(*str && *str != ':')
+		str++;
+	return(ft_atoi(str + 1));
+}
+
+static void parse_input(char **split, int *reg, uint8_t **ops, size_t *len)
+{
+	char *tmp;
+	int i;
+
+	reg[0] = get_register(*split);
+	split++;
+	reg[1] = get_register(*split);
+	split++;
+	reg[2] = get_register(*split);
+	split++;
+	*len = 0;
+	tmp = *split;
+	while(*tmp)
+	{
+		if(ft_isdigit(*tmp))
+			(*len)++;
+		tmp++;	
+	}
+	i = 0;
+	*ops = malloc(*len);
+	tmp = *split;
+	while(*tmp)
+	{
+		while(*tmp && !ft_isdigit(*tmp))
+			tmp++;
+		if(*tmp)
+			(*ops)[i] = (uint8_t)atoi(tmp);
+		i++;
+		while(ft_isdigit(*tmp))
+			tmp++;
+	}
+}
+
+static int combo(uint8_t val, int *reg)
+{
+	if(val <= 3)
+		return(val);
+	if(val == 7)
+	{
+		printf("err\n");
+		exit(1);
+	}
+	return(*(reg + (val - 4)));
+}
+
+static void exec_instructions(uint8_t *ops, int *reg, size_t len)
+{
+	size_t instr_ptr;
+
+	instr_ptr = 0;
+	while(instr_ptr < len)
+	{
+//		printf("op : %d, %d\n", ops[instr_ptr], ops[instr_ptr + 1]);
+		switch (ops[instr_ptr])
+		{
+			case 0:
+				reg[0] = reg[0] / pow(2, combo(ops[instr_ptr + 1], reg));
+				instr_ptr += 2;
+				break;
+			case 1:
+				reg[1] = reg[1] ^ ops[instr_ptr + 1];
+				instr_ptr += 2;
+				break;
+			case 2:
+				reg[1] = combo(ops[instr_ptr + 1], reg) % 8;
+				instr_ptr += 2;
+				break;
+			case 3:
+				if(reg[0])
+					instr_ptr = ops[instr_ptr + 1];
+				else
+					instr_ptr += 2;
+				break;
+			case 4:
+				reg[1] = reg[1] ^ reg[2];
+				instr_ptr += 2;
+				break;
+			case 5:
+				printf("%u,", combo(ops[instr_ptr + 1], reg) % 8);
+				instr_ptr += 2;
+				break;
+			case 6:
+				reg[1] = reg[0] / pow(2, combo(ops[instr_ptr + 1], reg));
+				instr_ptr += 2;
+				break;
+			case 7:
+				reg[2] = reg[0] / pow(2, combo(ops[instr_ptr + 1], reg));
+				instr_ptr += 2;
+				break;
+		}
+	}
+}
+
+long int resolve_part1(char *input, char **split)
+{
+	(void)input;
+	int reg[3];
+	uint8_t *ops;
+	size_t len;
+	
+	parse_input(split, reg, &ops, &len);
+	exec_instructions(ops, reg, len);
+	printf("\n");
+	return(0);
+}