<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>AoC2021 on Welcome yo my personal blog</title><link>/categories/aoc2021/</link><description>Recent content in AoC2021 on Welcome yo my personal blog</description><generator>Hugo -- gohugo.io</generator><copyright>Copyright © 2016-{year} Giovani Zamboni. All Rights Reserved.</copyright><lastBuildDate>Wed, 01 Dec 2021 00:00:00 +0000</lastBuildDate><atom:link href="/categories/aoc2021/index.xml" rel="self" type="application/rss+xml"/><item><title>Advent of Code 2021 - Day 1</title><link>/posts/aoc2021day1/</link><pubDate>Wed, 01 Dec 2021 00:00:00 +0000</pubDate><guid>/posts/aoc2021day1/</guid><description>Day 1: Sonar Sweep Well&amp;hellip; let&amp;rsquo;s save the Christmas again, in a submarine&amp;hellip; ¯\_(ツ)_/¯.
The first problem is about to help the sub crew to check how quickly the depth increases. We have the sonar sweep report (our puzzle input) appears: each line is a measurement of the sea floor depth as the sweep looks further and further away from the submarine. And to do this, count the number of times a depth measurement increases from the previous measurement.</description></item></channel></rss>