adventofcode
Advent of Code (http://adventofcode.com) solutions written in Python 3 (by viliampucik)
advent-of-code
i know how to code now! here's my advent of code solutions that i can be somewhat proud of (by SansPapyrus683)
| adventofcode | advent-of-code | |
|---|---|---|
| 2 | 1 | |
| 31 | 5 | |
| - | - | |
| 6.3 | 8.9 | |
| 5 months ago | 10 days ago | |
| Python | Python | |
| - | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
adventofcode
Posts with mentions or reviews of adventofcode.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-01.
-
-🎄- 2021 Day 2 Solutions -🎄-
Python 3 - Minimal readable solution for both parts [GitHub] import fileinput aim, h, d = 0, 0, 0 for l in fileinput.input(): cmd, x = l.strip().split(" ") x = int(x) if cmd == "down": aim += x elif cmd == "up": aim -= x else: h += x; d += aim * x # cmd == "forward" print(h * aim) print(h * d)
-
-🎄- 2021 Day 1 Solutions -🎄-
Python 3 - Minimal readable solution for both parts [GitHub]
advent-of-code
Posts with mentions or reviews of advent-of-code.
We have used some of these posts to build our list of alternatives
and similar projects.
-
[2019 Day 19] C++ optimization issue
hey, so this is my current solution to day 19. it takes way too long to run, even though i've implemented the below optimizations: * as soon as you craft a geode bot, checks how many geodes it'll produce in the timespan * keeps a running variable tracking the total max # of geodes. if a state can't possibly produce enough geodes to even reach the total max, it's discarded. * if you can make any robot you desire, discard the state where you don't do anything.
What are some alternatives?
When comparing adventofcode and advent-of-code you can also consider the following projects:
advent-of-code - Advent of Code, solved with Python, Rust, Magma, GAP
advent-of-code - http://adventofcode.com
advent-of-code - Challenges for Advent of Code (https://adventofcode.com).
adventofcode
Advent-of-Code - Advent of Code problems solved in Python.
aoc - 🎄 advent of code 414⭐
advent-of-code - Public Repo for Advent of Code Solutions