Maks Verver maksverver
maksverver
/ 09-vectors.cc
Created
December 9, 2022 19:18
Advent of Code 2022 Day 9 solution with std::vectors
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <algorithm> | |
| #include <cassert> | |
| #include <cstdint> | |
| #include <cstdio> | |
| #include <iostream> | |
| #include <string> | |
| #include <utility> | |
| #include <vector> | |
| namespace { |
maksverver
/ 09-flat_hash_set.cc
Created
December 9, 2022 19:15
Advent of Code 2022 Day 9 solution with absl::flat_hash_set
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <algorithm> | |
| #include <cassert> | |
| #include <cstdint> | |
| #include <cstdio> | |
| #include <iostream> | |
| #include <string> | |
| #include <utility> | |
| #include <absl/hash/hash.h> | |
| #include <absl/container/flat_hash_set.h> |
maksverver
/ MemoryMappedFile.h
Last active
December 8, 2022 20:32
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #ifndef MEMORY_MAPPED_FILE_H_INCLUDED | |
| #define MEMORY_MAPPED_FILE_H_INCLUDED | |
| #include <utility> | |
| #include <cstdlib> | |
| #include <span> | |
| #include <sys/fcntl.h> | |
| #include <sys/mman.h> | |
| #include <sys/stat.h> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <algorithm> | |
| #include <atomic> | |
| #include <cassert> | |
| #include <chrono> | |
| #include <cstdint> | |
| #include <iostream> | |
| #include <string> | |
| #include <thread> | |
| #include <vector> |
maksverver
/ day-6-extra-part-2.rs
Created
December 6, 2022 17:28
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| const DATA: &[u8; 10_000_000] = include_bytes!("../input_extra.txt"); | |
| pub fn main() { | |
| let mut total = 0; | |
| let mut w = 0; | |
| let mut n = 1; | |
| 'main: while n <= 94 { | |
| let mut seen = 0u128; | |
| for i in (0..n).rev() { | |
| let mask = 1 << DATA[w + i]; |
maksverver
/ 02-1.bf
Created
December 2, 2022 14:09
Brainfuck solution for Advent of Code 2022 Day 2: Rock Paper Scissors
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| [ Advent of Code 2022 Day 2: Rock Paper Scissors (part 1) | |
| https://adventofcode.com/2022/day/2 | |
| Solution in standard Brainfuck (no 8 bit cells, no wraparound) | |
| Minimized representation: | |
| >,[-<++++++++[->--------<]>>,,>++++++++[<----------->-]<<[->+++<]>>++++<[->++++< | |
| [->-----<[->--<[->++++<[->++++<[->--<[->-----<[->++++<]]]]]]]]>[>>[-]+<<[->+<]>[ | |
| <+>-[<+>-[<+>-[<+>-[<+>-[<+>-[<+>-[<+>-[<+>-[>>+<<-<[-]>[<+>-]]]]]]]]]]]<[->+<]> |
maksverver
/ 01c.c
Created
December 2, 2022 11:07
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <assert.h> | |
| #include <stdio.h> | |
| static void update(int top[], int k, int value) { | |
| if (value < top[k - 1]) return; | |
| int i = k - 1; | |
| while (i > 0 && value > top[i - 1]) { | |
| top[i] = top[i - 1]; | |
| --i; |
maksverver
/ 01b.c
Created
December 2, 2022 11:07
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <assert.h> | |
| #include <stdbool.h> | |
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #include <sys/mman.h> | |
| #include <sys/stat.h> | |
| static void insert(int top[], int k, int value) { | |
| if (value <= top[k - 1]) return; | |
| int i = k - 1; |
maksverver
/ 01a.c
Created
December 2, 2022 11:06
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <assert.h> | |
| #include <stdbool.h> | |
| #include <stdio.h> | |
| #include <stdlib.h> | |
| static void update(int top[], int k, int value) { | |
| if (value < top[k - 1]) return; | |
| int i = k - 1; | |
| while (i > 0 && value > top[i - 1]) { |
maksverver
/ 25-up1.in
Created
December 25, 2021 21:38
This file has been truncated, but you can view the full file.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| ...v>.vv.........v>.>>.v..>v..............>.v.v>.....vv..>>.>.vv.>>vv>v>...>........v....>......v..v>.....v.>..v...>......v....>......>.>....>..v...>.>v.....>v.vv>.>..>.v>.v.>>...>v....vvv.....v>...vv.......v......>>..v..v.....>v.vvv.....................>.v..v..>.>.vv>..v...>v......v.....>v.>.vvv.v..>>v..v..>.....>.>...v..>...v.vv......>>..v.>...>..v....v..>..>...>....>...>.>...v.v....>......>>.......v.>>v.....v.....v>v>.....>...>.v.>>..>.>.....v..v...>..>.>.>...v....v......v.v........v.......>.>v>..>...>.....>.>v.>>>..>.>...v.....>.....v.....v.....>..>>.v..v.v.....>.>v...v.v...>v.......vv.>............v..v..>.......>v.>...v..>>>...>.>.>....v....>>................>.v..>.>.....v>.v...v.....v..v>......>.....>...v........v.....>....>.>.v>>.......v.....v>.....v.>v.>.>>>...>v>........>.v.>.....v..>>.v....>.........v>v>..v.....>.....>.v..>..v.>..v..>....>.>.vv.>...>..v.>.....v.........>>..vv>........v>....v.......v.v..v.....v..v.>.v.v...>.....>...>.>.....v.......v...>v.>.>v.v>.......>>v.>>>. | |
| ..v.>...v>v>>v......... |