Skip to content

Instantly share code, notes, and snippets.

@yuk1ty
Last active December 5, 2022 01:35
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save yuk1ty/2fe1a8c73a8f4af622bca7aac79c9a66 to your computer and use it in GitHub Desktop.
Save yuk1ty/2fe1a8c73a8f4af622bca7aac79c9a66 to your computer and use it in GitHub Desktop.

ちょうど Advent of Code 2022 を解いていたので、解き終わった問題を ChatGPT に流してみた。使ったのはday1。

https://adventofcode.com/2022/day/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?

回答

解き方の方針と擬似コードを提示してくれた。効率が悪そうな手を踏んでなさそうだし、中身もあってそう。


To solve this problem, you need to read the input, which describes the food items carried by each Elf. Each Elf's food is separated by a blank line. To find the Elf carrying the most Calories, you need to sum the Calories of each Elf's food and then find the maximum of those sums.

Here is some pseudocode that solves the problem:

# Read the input
food_items = []
current_elf_food = []

while there are more lines in the input:
    line = read the next line
    if the line is blank:
        # We've reached the end of the current Elf's food
        food_items.append(current_elf_food)
        current_elf_food = []
    else:
        # This is a food item, so add its Calories to the current Elf's food
        current_elf_food.append(line)

# Handle the last Elf's food
food_items.append(current_elf_food)

# Find the Elf carrying the most Calories
max_calories = 0
for elf_food in food_items:
    calories = sum(elf_food)
    if calories > max_calories:
        max_calories = calories

# Output the result
print(max_calories)

This code reads the input and creates a list of food items for each Elf. It then finds the sum of the Calories of each Elf's food and outputs the maximum of those sums. This is the number of Calories carried by the Elf carrying the most Calories.


擬似コードを Python で完全に動くように書いてみてもらったw

質問

Could you complete the pseudocode in Python?

回答

Sure! Here is the code in Python:

# Read the input
food_items = []
current_elf_food = []

while True:
    try:
        line = input()
    except EOFError:
        break

    if line == '':
        # We've reached the end of the current Elf's food
        food_items.append(current_elf_food)
        current_elf_food = []
    else:
        # This is a food item, so add its Calories to the current Elf's food
        current_elf_food.append(int(line))

# Handle the last Elf's food
food_items.append(current_elf_food)

# Find the Elf carrying the most Calories
max_calories = 0
for elf_food in food_items:
    calories = sum(elf_food)
    if calories > max_calories:
        max_calories = calories

# Output the result
print(max_calories)

This code reads the input line by line and stops when it reaches the end of the input (indicated by an EOFError). It then processes each line and adds the Calories of each food item to the current Elf's food list. When it encounters a blank line, it adds the current Elf's food list to the food_items list and starts a new list for the next Elf. After it has processed all the input, it finds the maximum Calories of all the Elves' food and outputs the result.


そして、これをさらに Rust でも書いてもらった。

質問

Could you rewrite the pseudocode in Rust?

回答

Sure, here is the pseudocode rewritten in Rust:

// Read the input
let mut food_items = Vec::new();
let mut current_elf_food = Vec::new();

loop {
    let mut line = String::new();
    match io::stdin().read_line(&mut line) {
        Ok(0) => break, // End of input
        Ok(_) => {
            if line.trim() == "" {
                // We've reached the end of the current Elf's food
                food_items.push(current_elf_food);
                current_elf_food = Vec::new();
            } else {
                // This is a food item, so add its Calories to the current Elf's food
                current_elf_food.push(line.trim().parse::<i32>().unwrap());
            }
        },
        Err(_) => break, // Error reading input
    }
}

// Handle the last Elf's food
food_items.push(current_elf_food);

// Find the Elf carrying the most Calories
let mut max_calories = 0;
for elf_food in &food_items {
    let calories = elf_food.iter().sum();
    if calories > max_calories {
        max_calories = calories;
    }
}

// Output the result
println!("{}", max_calories);

This code reads the input line by line and stops when it reaches the end of the input (indicated by Ok(0)). It then processes each line and adds the Calories of each food item to the current Elf's food list. When it encounters a blank line, it adds the current Elf's food list to the food_items list and starts a new list for the next Elf. After it has processed all the input, it finds the maximum Calories of all the Elves' food and outputs the result.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment