[w a y s]

Hola,

comparto en este post mi solución en java del día 1 de Advent of Code.

Enunciado de la parte 1

Santa's reindeer typically eat regular reindeer food, but they need a lot of magical energy to deliver presents on Christmas. For that, their favorite snack is a special type of star fruit that only grows deep in the jungle. The Elves have brought you on their annual expedition to the grove where the fruit grows.

To supply enough magical energy, the expedition needs to retrieve a minimum of fifty stars by December 25th. Although the Elves assure you that the grove has plenty of fruit, you decide to grab any fruit you see along the way, just in case.

Collect stars by solving puzzles. Two puzzles will be made available on each day in the Advent calendar; the second puzzle is unlocked when you complete the first. Each puzzle grants one star. Good luck!

The jungle must be too overgrown and difficult to navigate in vehicles or access from the air; the Elves' expedition traditionally goes on foot. As your boats approach land, the Elves begin taking inventory of their supplies. One important consideration is food - in particular, the number of Calories each Elf is carrying (your puzzle input).

The Elves take turns writing down the number of Calories contained by the various meals, snacks, rations, etc. that they've brought with them, one item per line. Each Elf separates their own inventory from the previous Elf's inventory (if any) by a blank line.

For example, suppose the Elves finish writing their items' Calories and end up with the following list:

1000
2000
3000

4000

5000
6000

7000
8000
9000

10000
This list represents the Calories of the food carried by five Elves:

The first Elf is carrying food with 1000, 2000, and 3000 Calories, a total of 6000 Calories.
The second Elf is carrying one food item with 4000 Calories.
The third Elf is carrying food with 5000 and 6000 Calories, a total of 11000 Calories.
The fourth Elf is carrying food with 7000, 8000, and 9000 Calories, a total of 24000 Calories.
The fifth Elf is carrying one food item with 10000 Calories.
In case the Elves get hungry and need extra snacks, they need to know which Elf to ask: they'd like to know how many Calories are being carried by the Elf carrying the most Calories. In the example above, this is 24000 (carried by the fourth Elf).

Find the Elf carrying the most Calories. How many total Calories is that Elf carrying?

[cerrar]

Enunciado de la parte 2

--- Part Two ---
By the time you calculate the answer to the Elves' question, they've already realized that the Elf carrying the most Calories of food might eventually run out of snacks.

To avoid this unacceptable situation, the Elves would instead like to know the total Calories carried by the top three Elves carrying the most Calories. That way, even if one of those Elves runs out of snacks, they still have two backups.

In the example above, the top three Elves are the fourth Elf (with 24000 Calories), then the third Elf (with 11000 Calories), then the fifth Elf (with 10000 Calories). The sum of the Calories carried by these three elves is 45000.

Find the top three Elves carrying the most Calories. How many Calories are those Elves carrying in total?

[cerrar]

Código: (Posible solución en java) [Seleccionar]

package aoc_2022;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class Day1 {
    private static final File INPUT = new File("2022_inputs/2022_day1_input.txt");
    List<Integer> calories;

    Day1(){
        calories = new ArrayList<>();
    }

    private void parseInput(){
        try(BufferedReader br = new BufferedReader(new FileReader(INPUT))){
            String calory = "";
            int sum = 0;
            while((calory = br.readLine()) != null){
                if(calory.equals("")) {
                    calories.add(sum);
                    sum = 0;
                }else
                    sum += Integer.parseInt(calory);
            }
        }catch(IOException e){
            System.err.println("Error getting input from file.");
        }
    }

    private int solvePartOne(){
        return Collections.max(calories);
    }

    private int solvePartTwo(){
        Collections.sort(calories);
        return calories.get(calories.size()-1) + calories.get(calories.size()-2) + calories.get(calories.size()-3);
    }

    public static void main(String[] args) {
        Day1 d1 = new Day1();
        d1.parseInput();
        System.out.println(d1.solvePartOne());
        System.out.println(d1.solvePartTwo());
    }
}

!Espero vuestras soluciones¡

[geómetracat]

Ahí va la mía en Python:

Código: [Seleccionar]

with open("input1.txt") as f:
    lines = f.read()[:-1].split('\n\n')
   
sumlist = sorted([sum([int(n) for n in line.split('\n')]) for line in lines], reverse = True)
print(sumlist[0])            # Part 1
print(sum(sumlist[:3]))      # Part 2


[Eparoh]

La mia en Maple y Excel:

Código: [Seleccionar]

F:=cat(currentdir(),"\\Template 1.txt"):

Calorias:=proc(File,n)
   local S, S_cont, r1, r2, S_aux, i, j;
      S:=[seq(0,i=1..n)];
      S_aux:=S;
      S_cont:=0;
      r1:=FileTools[Text][ReadLine](File);
      r2:=FileTools[Text][ReadLine](File);
      while r1 <> NULL or r2 <> NULL do
         if r1="" or (r1 <> NULL and r2 = NULL) then
            for i from 1 to n do
               if S_cont>S[i] then
                  S[i]:=S_cont;
                  for j from i+1 to n do
                     S[j]:=S_aux[j-1];
                  od;
                  break;
               fi;
            od;
            S_cont:=0;
            S_aux:=S;
         else
            S_cont:=S_cont+parse(r1);
         fi;
         r1:=r2;
         r2:=FileTools[Text][ReadLine](File);
      od;
   FileTools[Text][Close](File);
   RETURN(S);
end:

add(x, x in Calorias(F,1));
add(x, x in Calorias(F,3));

Un saludo