matthias/aoc2020
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

updated day05

Browse Source
This commit is contained in:
Matthias Bilger
2020-12-05 06:26:33 +01:00
parent eb9c615c58
commit 21fd6de1cd
13 changed files with 3678 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
check.sh Executable file
View File

@@ -0,0 +1,9 @@
#!/bin/bash
day=$(date +'%-d')
day0=$(date +'%d')
# /usr/bin/open https://adventofcode.com/2020/day/$day/input
curl -b cookies.txt https://adventofcode.com/2020/
#curl -b cookies.txt https://adventofcode.com/2020/day/$day -o day$day0/index.html

1160
day04/Text.txt Normal file
View File

File diff suppressed because it is too large Load Diff

BIN
day04/a.out Executable file
View File

Binary file not shown.

1160
day04/data/data.txt Normal file
View File

File diff suppressed because it is too large Load Diff

13
day04/data/sample.txt Normal file
View File

@@ -0,0 +1,13 @@
eyr:1972 cid:100
hcl:#18171d ecl:amb hgt:170 pid:186cm iyr:2018 byr:1926
iyr:2019
hcl:#602927 eyr:1967 hgt:170cm
ecl:grn pid:012533040 byr:1946
hcl:dab227 iyr:2012
ecl:brn hgt:182cm pid:021572410 eyr:2020 byr:1992 cid:277
hgt:59cm ecl:zzz
eyr:2038 hcl:74454a iyr:2023
pid:3556412378 byr:2007

154
day04/index.html Normal file
View File

@@ -0,0 +1,154 @@
<!DOCTYPE html>
<html lang="en-us">
<head>
<meta charset="utf-8"/>
<title>Day 4 - Advent of Code 2020</title>
<!--[if lt IE 9]><script src="/static/html5.js"></script><![endif]-->
<link href='//fonts.googleapis.com/css?family=Source+Code+Pro:300&subset=latin,latin-ext' rel='stylesheet' type='text/css'/>
<link rel="stylesheet" type="text/css" href="/static/style.css?25"/>
<link rel="stylesheet alternate" type="text/css" href="/static/highcontrast.css?0" title="High Contrast"/>
<link rel="shortcut icon" href="/favicon.png"/>
</head><!--
Oh, hello! Funny seeing you here.
I appreciate your enthusiasm, but you aren't going to find much down here.
There certainly aren't clues to any of the puzzles. The best surprises don't
even appear in the source until you unlock them for real.
Please be careful with automated requests; I'm not a massive company, and I can
only take so much traffic. Please be considerate so that everyone gets to play.
If you're curious about how Advent of Code works, it's running on some custom
Perl code. Other than a few integrations (auth, analytics, ads, social media),
I built the whole thing myself, including the design, animations, prose, and
all of the puzzles.
The puzzles are most of the work; preparing a new calendar and a new set of
puzzles each year takes all of my free time for 4-5 months. A lot of effort
went into building this thing - I hope you're enjoying playing it as much as I
enjoyed making it for you!
If you'd like to hang out, I'm @ericwastl on Twitter.
- Eric Wastl
-->
<body>
<header><div><h1 class="title-global"><a href="/">Advent of Code</a></h1><nav><ul><li><a href="/2020/about">[About]</a></li><li><a href="/2020/events">[Events]</a></li><li><a href="https://teespring.com/adventofcode-2019" target="_blank">[Shop]</a></li><li><a href="/2020/settings">[Settings]</a></li><li><a href="/2020/auth/logout">[Log Out]</a></li></ul></nav><div class="user">m42e <a href="/2020/support" class="supporter-badge" title="Advent of Code Supporter">(AoC++)</a> <span class="star-count">6*</span></div></div><div><h1 class="title-event">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="title-event-wrap">y(</span><a href="/2020">2020</a><span class="title-event-wrap">)</span></h1><nav><ul><li><a href="/2020">[Calendar]</a></li><li><a href="/2020/support">[AoC++]</a></li><li><a href="/2020/sponsors">[Sponsors]</a></li><li><a href="/2020/leaderboard">[Leaderboard]</a></li><li><a href="/2020/stats">[Stats]</a></li></ul></nav></div></header>
<div id="sidebar">
<div id="sponsor"><div class="quiet">Our <a href="/2020/sponsors">sponsors</a> help make Advent of Code possible:</div><div class="sponsor"><a href="https://www.twilio.com/quest?utm_source=advent-of-code-20&amp;utm_medium=website" target="_blank" onclick="if(ga)ga('send','event','sponsor','sidebar',this.href);" rel="noopener">TwilioQuest</a> - Learn to code and lead your intrepid crew on a mission to save The Cloud in TwilioQuest, a PC role-playing game inspired by classics of the 16-bit era. Free forever, and available now for Windows, Mac, and Linux.</div></div>
</div><!--/sidebar-->
<main>
<script>window.addEventListener('click', function(e,s,r){if(e.target.nodeName==='CODE'&&e.detail===3){s=window.getSelection();s.removeAllRanges();r=document.createRange();r.selectNodeContents(e.target);s.addRange(r);}});</script>
<article class="day-desc"><h2>--- Day 4: Passport Processing ---</h2><p>You arrive at the airport only to realize that you grabbed your North Pole Credentials instead of your passport. While these documents are extremely similar, North Pole Credentials aren't issued by a country and therefore aren't actually valid documentation for travel in most of the world.</p>
<p>It seems like you're not the only one having problems, though; a very long line has formed for the automatic passport scanners, and the delay could upset your travel itinerary.</p>
<p>Due to some questionable network security, you realize you might be able to solve both of these problems at the same time.</p>
<p>The automatic passport scanners are slow because they're having trouble <em>detecting which passports have all required fields</em>. The expected fields are as follows:</p>
<ul>
<li><code>byr</code> (Birth Year)</li>
<li><code>iyr</code> (Issue Year)</li>
<li><code>eyr</code> (Expiration Year)</li>
<li><code>hgt</code> (Height)</li>
<li><code>hcl</code> (Hair Color)</li>
<li><code>ecl</code> (Eye Color)</li>
<li><code>pid</code> (Passport ID)</li>
<li><code>cid</code> (Country ID)</li>
</ul>
<p>Passport data is validated in batch files (your puzzle input). Each passport is represented as a sequence of <code>key:value</code> pairs separated by spaces or newlines. Passports are separated by blank lines.</p>
<p>Here is an example batch file containing four passports:</p>
<pre><code>ecl:gry pid:860033327 eyr:2020 hcl:#fffffd
byr:1937 iyr:2017 cid:147 hgt:183cm
iyr:2013 ecl:amb cid:350 eyr:2023 pid:028048884
hcl:#cfa07d byr:1929
hcl:#ae17e1 iyr:2013
eyr:2024
ecl:brn pid:760753108 byr:1931
hgt:179cm
hcl:#cfa07d eyr:2025 pid:166559648
iyr:2011 ecl:brn hgt:59in
</code></pre>
<p>The first passport is <em>valid</em> - all eight fields are present. The second passport is <em>invalid</em> - it is missing <code>hgt</code> (the Height field).</p>
<p>The third passport is interesting; the <em>only missing field</em> is <code>cid</code>, so it looks like data from North Pole Credentials, not a passport at all! Surely, nobody would mind if you made the system temporarily ignore missing <code>cid</code> fields. Treat this "passport" as <em>valid</em>.</p>
<p>The fourth passport is missing two fields, <code>cid</code> and <code>byr</code>. Missing <code>cid</code> is fine, but missing any other field is not, so this passport is <em>invalid</em>.</p>
<p>According to the above rules, your improved system would report <code><em>2</em></code> valid passports.</p>
<p>Count the number of <em>valid</em> passports - those that have all required fields. Treat <code>cid</code> as optional. <em>In your batch file, how many passports are valid?</em></p>
</article>
<p>To begin, <a href="4/input" target="_blank">get your puzzle input</a>.</p>
<form method="post" action="4/answer"><input type="hidden" name="level" value="1"/><p>Answer: <input type="text" name="answer" autocomplete="off"/> <input type="submit" value="[Submit]"/></p></form>
<p>You can also <span class="share">[Share<span class="share-content">on
<a href="https://twitter.com/intent/tweet?text=%22Passport+Processing%22+%2D+Day+4+%2D+Advent+of+Code+2020&amp;url=https%3A%2F%2Fadventofcode%2Ecom%2F2020%2Fday%2F4&amp;related=ericwastl&amp;hashtags=AdventOfCode" target="_blank">Twitter</a>
<a href="javascript:void(0);" onclick="var mastodon_instance=prompt('Mastodon Instance / Server Name?'); if(typeof mastodon_instance==='string' && mastodon_instance.length){this.href='https://'+mastodon_instance+'/share?text=%22Passport+Processing%22+%2D+Day+4+%2D+Advent+of+Code+2020+%23AdventOfCode+https%3A%2F%2Fadventofcode%2Ecom%2F2020%2Fday%2F4'}else{return false;}" target="_blank">Mastodon</a
></span>]</span> this puzzle.</p>
</main>
<!-- ga -->
<script>
(function(i,s,o,g,r,a,m){i['GoogleAnalyticsObject']=r;i[r]=i[r]||function(){
(i[r].q=i[r].q||[]).push(arguments)},i[r].l=1*new Date();a=s.createElement(o),
m=s.getElementsByTagName(o)[0];a.async=1;a.src=g;m.parentNode.insertBefore(a,m)
})(window,document,'script','//www.google-analytics.com/analytics.js','ga');
ga('create', 'UA-69522494-1', 'auto');
ga('set', 'anonymizeIp', true);
ga('send', 'pageview');
</script>
<!-- /ga -->
</body>
</html>

120
day04/module.py Normal file
View File

@@ -0,0 +1,120 @@
from aoc.input import get_input
import re
from aoc.partselector import part_one, part_two
def pw(line):
return line.strip()
inp = get_input(pw)
fields = [
"byr",
"iyr",
"eyr",
"hgt",
"hcl",
"ecl",
"pid",
]
def p1():
inp = get_input(pw)
count = 0
passports = []
data = []
valid = 0
for i in inp:
if i == '':
d = ' '.join(data)
pd = d.split(' ')
lst = dict(map(lambda x: x.split(':'), pd))
v = True
for f in fields:
if f not in lst:
v = False
if v :
valid += 1
print(v, sorted(lst.items(), key=lambda x:x[0]))
passports.append(' '.join(data))
data = []
continue
data.append(i)
passports.append(' '.join(data))
data = []
print(valid)
fields2 = {"byr": "[0-9]{4}",
"iyr": "[0-9]{4}",
"eyr": "[0-9]{4}",
"hgt": "[0-9]*(in|cm)",
"hcl": "#[0-9a-f]{6}",
"ecl": "(amb|blu|brn|gry|grn|hzl|oth)",
"pid": "[0-9]{9}",
}
def p2():
inp = get_input(pw)
count = 0
passports = []
data = []
valid = 0
for i in inp:
if i == '':
d = ' '.join(data)
pd = d.split(' ')
lst = dict(map(lambda x: x.split(':'), pd))
v = True
for f in fields2.keys():
print (f, end=" ")
if f not in lst:
v = False
else:
print("----->", fields2[f], lst[f])
if f in lst:
v = v and re.match(fields2[f], lst[f]) is not None
print (v, end=" ")
if f == 'pid':
v = v and len(lst[f]) == 9
print (v, end=" ")
if f == 'byr':
v = v and int(lst[f]) >= 1920 and int(lst[f]) <= 2002
print (v, end=" ")
if f == 'iyr':
v = v and int(lst[f]) >= 2010 and int(lst[f]) <= 2020
print ( v, end=" ")
if f == 'eyr':
v = v and int(lst[f]) >= 2020 and int(lst[f]) <= 2030
print ( v, end=" ")
if f == 'hgt':
m = re.match(fields2[f], lst[f])
if m is not None:
if m.group(1) == 'in':
v = v and int(lst[f][:-2]) <= 76
v = v and int(lst[f][:-2]) >= 59
if m.group(1) == 'cm':
v = v and int(lst[f][:-2]) >= 150
v = v and int(lst[f][:-2]) <= 193
print ( v, end=" ")
print()
if v :
valid += 1
if not v:
print()
print(v, sorted(lst.items(), key=lambda x:x[0]))
print()
passports.append(' '.join(data))
data = []
continue
data.append(i)
print(valid)
print('done')
if part_one():
p1()
if part_two():
p2()

94
day04/test.cpp Normal file
View File

@@ -0,0 +1,94 @@
#include <iostream>
#include <vector>
#include <fstream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string line;
ifstream myfile("Text.txt");
//byr iyr eye hgt hcl ecl pid cid
/*byr(Birth Year)
iyr(Issue Year)
eyr(Expiration Year)
hgt(Height)
hcl(Hair Color)
ecl(Eye Color)
pid(Passport ID)
cid(Country ID)*/
int valid = 0;
int valid2 = 0;
if (myfile.is_open())
{
string passport;
while (getline(myfile, line))
{
passport += line + " ";
if (line == "") {
bool byr, iyr, eyr, hgt, hcl, ecl, pid;
byr = iyr = eyr = hgt = hcl = ecl = pid = false;
if (passport.find("byr:") != std::string::npos) {
byr = true;
}
if (passport.find("iyr:") != std::string::npos) {
iyr = true;
}
if (passport.find("eyr:") != std::string::npos) {
eyr = true;
}
if (passport.find("hgt:") != std::string::npos) {
hgt = true;
}
if (passport.find("hcl:") != std::string::npos) {
hcl = true;
}
if (passport.find("ecl:") != std::string::npos) {
ecl = true;
}
if (passport.find("pid:") != std::string::npos) {
pid = true;
}
bool a, b;
a = false;
b = false;
if (byr == iyr == eyr == hgt == hcl == ecl == pid == true) {
valid++;
a = true;
}
if (byr == true && iyr == true && eyr == true && hgt == true && hcl == true && ecl == true && pid == true) {
valid2++;
b=true;
}
if (a != b){
cout << (pid == true) << endl;
cout << (ecl == pid == true) << endl;
cout << (hcl == ecl == pid == true) << endl;
cout << (hgt == hcl == ecl == pid == true) << endl;
cout << (eyr == hgt == hcl == ecl == pid == true) << endl;
cout << (iyr == eyr == hgt == hcl == ecl == pid == true) << endl;
cout << (byr == iyr == eyr == hgt == hcl == ecl == pid == true) << endl;
cout << passport;
}
passport = "";
}
}
}
cout << valid;
cout << valid2;
myfile.close();
}

757
day05/data/data.txt Normal file
View File

File diff suppressed because it is too large Load Diff

4
day05/data/sample.txt Normal file
View File

@@ -0,0 +1,4 @@
FBFBBFFRLR
BFFFBBFRRR
FFFBBBFRRR
BBFFBBFRLL

151
day05/index.html Normal file
View File

@@ -0,0 +1,151 @@
<!DOCTYPE html>
<html lang="en-us">
<head>
<meta charset="utf-8"/>
<title>Day 5 - Advent of Code 2020</title>
<!--[if lt IE 9]><script src="/static/html5.js"></script><![endif]-->
<link href='//fonts.googleapis.com/css?family=Source+Code+Pro:300&subset=latin,latin-ext' rel='stylesheet' type='text/css'/>
<link rel="stylesheet" type="text/css" href="/static/style.css?25"/>
<link rel="stylesheet alternate" type="text/css" href="/static/highcontrast.css?0" title="High Contrast"/>
<link rel="shortcut icon" href="/favicon.png"/>
</head><!--
Oh, hello! Funny seeing you here.
I appreciate your enthusiasm, but you aren't going to find much down here.
There certainly aren't clues to any of the puzzles. The best surprises don't
even appear in the source until you unlock them for real.
Please be careful with automated requests; I'm not a massive company, and I can
only take so much traffic. Please be considerate so that everyone gets to play.
If you're curious about how Advent of Code works, it's running on some custom
Perl code. Other than a few integrations (auth, analytics, ads, social media),
I built the whole thing myself, including the design, animations, prose, and
all of the puzzles.
The puzzles are most of the work; preparing a new calendar and a new set of
puzzles each year takes all of my free time for 4-5 months. A lot of effort
went into building this thing - I hope you're enjoying playing it as much as I
enjoyed making it for you!
If you'd like to hang out, I'm @ericwastl on Twitter.
- Eric Wastl
-->
<body>
<header><div><h1 class="title-global"><a href="/">Advent of Code</a></h1><nav><ul><li><a href="/2020/about">[About]</a></li><li><a href="/2020/events">[Events]</a></li><li><a href="https://teespring.com/adventofcode-2019" target="_blank">[Shop]</a></li><li><a href="/2020/settings">[Settings]</a></li><li><a href="/2020/auth/logout">[Log Out]</a></li></ul></nav><div class="user">m42e <a href="/2020/support" class="supporter-badge" title="Advent of Code Supporter">(AoC++)</a> <span class="star-count">8*</span></div></div><div><h1 class="title-event">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="title-event-wrap">/*</span><a href="/2020">2020</a><span class="title-event-wrap">*/</span></h1><nav><ul><li><a href="/2020">[Calendar]</a></li><li><a href="/2020/support">[AoC++]</a></li><li><a href="/2020/sponsors">[Sponsors]</a></li><li><a href="/2020/leaderboard">[Leaderboard]</a></li><li><a href="/2020/stats">[Stats]</a></li></ul></nav></div></header>
<div id="sidebar">
<div id="sponsor"><div class="quiet">Our <a href="/2020/sponsors">sponsors</a> help make Advent of Code possible:</div><div class="sponsor"><a href="https://github.com/" target="_blank" onclick="if(ga)ga('send','event','sponsor','sidebar',this.href);" rel="noopener">GitHub</a> - We&apos;re hiring engineers to make GitHub fast. Interested? Email fast@github.com with details of exceptional performance work you&apos;ve done in the past.</div></div>
</div><!--/sidebar-->
<main>
<script>window.addEventListener('click', function(e,s,r){if(e.target.nodeName==='CODE'&&e.detail===3){s=window.getSelection();s.removeAllRanges();r=document.createRange();r.selectNodeContents(e.target);s.addRange(r);}});</script>
<article class="day-desc"><h2>--- Day 5: Binary Boarding ---</h2><p>You board your plane only to discover a new problem: you dropped your boarding pass! You aren't sure which seat is yours, and all of the flight attendants are busy with the flood of people that suddenly made it through passport control.</p>
<p>You write a <span title="No problem!">quick program</span> to use your phone's camera to scan all of the nearby boarding passes (your puzzle input); perhaps you can find your seat through process of elimination.</p>
<p>Instead of <a target="_blank" href="https://www.youtube.com/watch?v=oAHbLRjF0vo">zones or groups</a>, this airline uses <em>binary space partitioning</em> to seat people. A seat might be specified like <code>FBFBBFFRLR</code>, where <code>F</code> means "front", <code>B</code> means "back", <code>L</code> means "left", and <code>R</code> means "right".</p>
<p>The first 7 characters will either be <code>F</code> or <code>B</code>; these specify exactly one of the <em>128 rows</em> on the plane (numbered <code>0</code> through <code>127</code>). Each letter tells you which half of a region the given seat is in. Start with the whole list of rows; the first letter indicates whether the seat is in the <em>front</em> (<code>0</code> through <code>63</code>) or the <em>back</em> (<code>64</code> through <code>127</code>). The next letter indicates which half of that region the seat is in, and so on until you're left with exactly one row.</p>
<p>For example, consider just the first seven characters of <code>FBFBBFFRLR</code>:</p>
<ul>
<li>Start by considering the whole range, rows <code>0</code> through <code>127</code>.</li>
<li><code>F</code> means to take the <em>lower half</em>, keeping rows <code>0</code> through <code>63</code>.</li>
<li><code>B</code> means to take the <em>upper half</em>, keeping rows <code>32</code> through <code>63</code>.</li>
<li><code>F</code> means to take the <em>lower half</em>, keeping rows <code>32</code> through <code>47</code>.</li>
<li><code>B</code> means to take the <em>upper half</em>, keeping rows <code>40</code> through <code>47</code>.</li>
<li><code>B</code> keeps rows <code>44</code> through <code>47</code>.</li>
<li><code>F</code> keeps rows <code>44</code> through <code>45</code>.</li>
<li>The final <code>F</code> keeps the lower of the two, <em>row <code>44</code></em>.</li>
</ul>
<p>The last three characters will be either <code>L</code> or <code>R</code>; these specify exactly one of the <em>8 columns</em> of seats on the plane (numbered <code>0</code> through <code>7</code>). The same process as above proceeds again, this time with only three steps. <code>L</code> means to keep the <em>lower half</em>, while <code>R</code> means to keep the <em>upper half</em>.</p>
<p>For example, consider just the last 3 characters of <code>FBFBBFFRLR</code>:</p>
<ul>
<li>Start by considering the whole range, columns <code>0</code> through <code>7</code>.</li>
<li><code>R</code> means to take the <em>upper half</em>, keeping columns <code>4</code> through <code>7</code>.</li>
<li><code>L</code> means to take the <em>lower half</em>, keeping columns <code>4</code> through <code>5</code>.</li>
<li>The final <code>R</code> keeps the upper of the two, <em>column <code>5</code></em>.</li>
</ul>
<p>So, decoding <code>FBFBBFFRLR</code> reveals that it is the seat at <em>row <code>44</code>, column <code>5</code></em>.</p>
<p>Every seat also has a unique <em>seat ID</em>: multiply the row by 8, then add the column. In this example, the seat has ID <code>44 * 8 + 5 = <em>357</em></code>.</p>
<p>Here are some other boarding passes:</p>
<ul>
<li><code>BFFFBBFRRR</code>: row <code>70</code>, column <code>7</code>, seat ID <code>567</code>.</li>
<li><code>FFFBBBFRRR</code>: row <code>14</code>, column <code>7</code>, seat ID <code>119</code>.</li>
<li><code>BBFFBBFRLL</code>: row <code>102</code>, column <code>4</code>, seat ID <code>820</code>.</li>
</ul>
<p>As a sanity check, look through your list of boarding passes. <em>What is the highest seat ID on a boarding pass?</em></p>
</article>
<p>To begin, <a href="5/input" target="_blank">get your puzzle input</a>.</p>
<form method="post" action="5/answer"><input type="hidden" name="level" value="1"/><p>Answer: <input type="text" name="answer" autocomplete="off"/> <input type="submit" value="[Submit]"/></p></form>
<p>You can also <span class="share">[Share<span class="share-content">on
<a href="https://twitter.com/intent/tweet?text=%22Binary+Boarding%22+%2D+Day+5+%2D+Advent+of+Code+2020&amp;url=https%3A%2F%2Fadventofcode%2Ecom%2F2020%2Fday%2F5&amp;related=ericwastl&amp;hashtags=AdventOfCode" target="_blank">Twitter</a>
<a href="javascript:void(0);" onclick="var mastodon_instance=prompt('Mastodon Instance / Server Name?'); if(typeof mastodon_instance==='string' && mastodon_instance.length){this.href='https://'+mastodon_instance+'/share?text=%22Binary+Boarding%22+%2D+Day+5+%2D+Advent+of+Code+2020+%23AdventOfCode+https%3A%2F%2Fadventofcode%2Ecom%2F2020%2Fday%2F5'}else{return false;}" target="_blank">Mastodon</a
></span>]</span> this puzzle.</p>
</main>
<!-- ga -->
<script>
(function(i,s,o,g,r,a,m){i['GoogleAnalyticsObject']=r;i[r]=i[r]||function(){
(i[r].q=i[r].q||[]).push(arguments)},i[r].l=1*new Date();a=s.createElement(o),
m=s.getElementsByTagName(o)[0];a.async=1;a.src=g;m.parentNode.insertBefore(a,m)
})(window,document,'script','//www.google-analytics.com/analytics.js','ga');
ga('create', 'UA-69522494-1', 'auto');
ga('set', 'anonymizeIp', true);
ga('send', 'pageview');
</script>
<!-- /ga -->
</body>
</html>

55
day05/module.py Normal file
View File

@@ -0,0 +1,55 @@
from aoc.input import get_input
import re
from aoc.partselector import part_one, part_two
def pw(line):
return line.strip()
def p1():
inp = get_input(pw)
count = 0
passes = []
for i in inp:
index = 64
pos = 63
for l in i[:6]:
if l == 'B':
pos = pos + index/2
if l == 'F':
pos = pos - index/2
index = index//2
index2 = 4
pos2 = 3
positions = {
'LLL': 0,
'LLR': 1,
'LRL': 2,
'LRR': 3,
'RLL': 4,
'RLR': 5,
'RRL': 6,
'RRR': 7,
}
pos2 = positions[i[7:]]
passes.append(pos * 8 + pos2 )
print(max(passes))
return passes
def p2(result1):
passes = sorted(result1)
last = 0
last2 = 0
for p in range(len(passes)-2):
if passes[p] == passes[p+1] - 1 and passes[p] == passes[p+2] - 2:
print(passes[p])
break
return passes
if part_one():
result1 = p1()
if part_two():
p2(result1)

2
open.sh
View File

@@ -3,7 +3,7 @@
day=$(date +'%-d') day=$(date +'%-d')
day0=$(date +'%d') day0=$(date +'%d')
/usr/bin/open https://adventofcode.com/2020/day/$day/input # /usr/bin/open https://adventofcode.com/2020/day/$day/input
curl -b cookies.txt https://adventofcode.com/2020/day/$day/input -o day$day0/data/data.txt curl -b cookies.txt https://adventofcode.com/2020/day/$day/input -o day$day0/data/data.txt
curl -b cookies.txt https://adventofcode.com/2020/day/$day -o day$day0/index.html curl -b cookies.txt https://adventofcode.com/2020/day/$day -o day$day0/index.html