Skip to content

Conversation

eunice-hong
Copy link
Collaborator

✔️ Solution

  1. Part 1. 100번째 지도를 그려 각 사분면에 있는 로봇의 개수를 각각 곱하여 문제를 해결하였습니다.
  2. Part 2. 모든 로봇이 Unique position에 있을 때 트리가 그려지는 최소 시간을 계산하였습니다.

✔️ Learned

image
  • Part 2 의 경우, 문제가 친절하지 않아 아래 참고 링크에 올라온 게시글을 참고하여 👀 눈으로 풀 뻔하였습니다. 댓글에서 다행히 code를 사용한 방법에 대한 힌트를 얻어 풀이에 성공했습니다.

✔️ Reference

@eunice-hong eunice-hong added the aoc: solution Solution to Advent of Code problems label Dec 14, 2024
@eunice-hong eunice-hong self-assigned this Dec 14, 2024
@eunice-hong eunice-hong requested a review from a team as a code owner December 14, 2024 10:42
@eunice-hong eunice-hong requested review from renardyreveur and removed request for a team December 14, 2024 10:42
Copy link
Collaborator

@renardyreveur renardyreveur left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 👍 👍

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

Labels

aoc: solution Solution to Advent of Code problems

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants