da7e/AdventOfCode-2025
1
0
Fork 0
mirror of https://github.com/DavidGailleton/AdventOfCode-2025.git synced 2026-01-26 23:11:58 +00:00
Code Issues Packages Projects Releases Wiki Activity

02 done

Browse Source
This commit is contained in:
David Gailleton
2025-12-06 20:42:33 +01:00
parent 86c2e68987
commit 613e2dd0a2
1 changed files with 15 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
02/main.c
View File

@@ -6,7 +6,7 @@
/* By: dgaillet <dgaillet@student.42.fr> +#+ +:+ +#+ */ /* By: dgaillet <dgaillet@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */ /* +#+#+#+#+#+ +#+ */
/* Created: 2025/12/05 12:39:53 by dgaillet #+# #+# */ /* Created: 2025/12/05 12:39:53 by dgaillet #+# #+# */
/* Updated: 2025/12/05 16:51:41 by dgaillet ### ########lyon.fr */ /* Updated: 2025/12/06 20:21:39 by dgaillet ### ########lyon.fr */
/* */ /* */
/* ************************************************************************** */ /* ************************************************************************** */
@@ -24,6 +24,7 @@ static int check_if_invalid(long long nb)
size_t len; size_t len;
str = ft_lltoa(nb); str = ft_lltoa(nb);
printf("%s\n", str);
if (!str) if (!str)
return (0); return (0);
len = strlen(str); len = strlen(str);
@@ -56,6 +57,7 @@ static long long *add_invalid(t_comb *comb, long long invalid)
} }
temp[i] = invalid; temp[i] = invalid;
free(comb->invalids); free(comb->invalids);
comb->nb_invalid++;
return (temp); return (temp);
} }
@@ -90,6 +92,8 @@ static void clear_lst(t_comb *lst)
} }
} }
//8175253565 -> too low
//24157613387
int main(void) int main(void)
{ {
t_comb *lst; t_comb *lst;
@@ -103,6 +107,7 @@ int main(void)
temp = lst; temp = lst;
while (temp) while (temp)
{ {
//printf("%lld - %lld\n", temp->first, temp->second);
get_invalids(temp); get_invalids(temp);
temp = temp->next; temp = temp->next;
} }
@@ -110,6 +115,7 @@ int main(void)
while (temp) while (temp)
{ {
i = 0; i = 0;
//printf("result = %lld", result);
while (i < temp->nb_invalid) while (i < temp->nb_invalid)
{ {
result += temp->invalids[i]; result += temp->invalids[i];
@@ -119,4 +125,11 @@ int main(void)
} }
printf("%llu", result); printf("%llu", result);
clear_lst(lst); clear_lst(lst);
close(fd);
} }
//iterer sur chaque node
//applique une fonction
//incrmeenter le retour de fonction dans res
//
//return res