├── 10 ├── jl │ └── 10.jl ├── mma │ └── 10.mma └── rb │ └── 10.rb ├── 11 └── rb │ └── 11.rb ├── .gitignore ├── 01 ├── c │ └── 01.c ├── hs │ └── 01.hs ├── js │ └── 01.js ├── mma │ └── 01.mma ├── py │ └── 01.py └── rb │ └── 01.rb ├── 02 ├── c │ └── 02.c ├── hs │ └── 02.hs ├── mma │ └── 02.mma ├── py │ └── 02.py └── rb │ └── 02.rb ├── 03 ├── asm │ └── 03.s ├── hs │ └── 03.hs ├── jl │ └── 03.jl ├── rb │ └── 03.rb └── rs │ └── 03.rs ├── 04 └── rb │ └── 04.rb ├── 05 ├── c │ └── 05.c ├── hs │ └── 05.hs ├── jy │ ├── 05_1.jy │ └── 05_2.jy ├── rb │ └── 05.rb ├── sh │ └── 05.sh └── vim │ └── 05.vim ├── 06 ├── hs │ └── 06.hs ├── ijs │ └── 06.ijs └── rb │ └── 06.rb ├── 07 └── rb │ └── 07.rb ├── 08 ├── hs │ └── 08.hs └── rb │ └── 08.rb ├── 09 ├── hs │ └── 09.hs ├── rb │ └── 09.rb └── rkt │ └── 09.rkt ├── LICENSE └── README.md /.gitignore: -------------------------------------------------------------------------------- 1 | input 2 | -------------------------------------------------------------------------------- /01/c/01.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int try(int *input, int len, int sum, int remaining, int startidx) { 4 | if (!remaining) return sum == 2020; 5 | for (int i = startidx; i < len; ++i) { 6 | int x = try(input, len, sum+input[i], remaining-1, i+1); 7 | if (x) return input[i]*x; 8 | } 9 | return 0; 10 | } 11 | 12 | int main() { 13 | FILE *fp = fopen("input", "r"); 14 | int input[500], i = 0, val; 15 | while (fscanf(fp, "%d", &val) > 0) input[i++] = val; 16 | fclose(fp); 17 | 18 | // part 1 19 | printf("%d\n", try(input, i, 0, 2, 0)); 20 | // part 2 21 | printf("%d\n", try(input, i, 0, 3, 0)); 22 | } 23 | -------------------------------------------------------------------------------- /01/hs/01.hs: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env runhaskell 2 | 3 | import Data.List 4 | import Data.Maybe 5 | 6 | comb _ 0 = [[]] 7 | comb [] _ = [] 8 | comb (x:xs) n = map (x:) (comb xs (n-1)) ++ comb xs n 9 | 10 | go = ((product . fromJust . find ((==2020) . sum)) .) . comb 11 | 12 | main = do 13 | input <- map read . lines <$> readFile "input" 14 | -- both parts 15 | mapM (putStrLn . show . go input) [2,3] 16 | -------------------------------------------------------------------------------- /01/js/01.js: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env node 2 | 3 | const fs = require('fs'); 4 | 5 | fs.readFile('input', 'utf-8', (_, s) => { 6 | const input = s.split('\n').map(x => +x), 7 | f = (sum, remaining, idx) => remaining ? 8 | input.slice(idx).map((n, i) => n * f(sum+n, remaining-1, i+1)).find(x => x) : 9 | sum == 2020; 10 | // both parts 11 | [2,3].map(n => console.log(f(0, n))); 12 | }); 13 | -------------------------------------------------------------------------------- /01/mma/01.mma: -------------------------------------------------------------------------------- 1 | input = ReadList@"input"; 2 | 3 | (* both parts *) 4 | Print[Times @@ SelectFirst[Subsets[input, {#}], EqualTo[2020]@*Total]] & /@ {2, 3}; 5 | 6 | (* vim: ft=mma 7 | *) 8 | -------------------------------------------------------------------------------- /01/py/01.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env python3 2 | 3 | from functools import reduce 4 | import itertools 5 | import operator 6 | 7 | data = map(int, open('input').readlines()) 8 | 9 | # both parts 10 | for n in [2, 3]: 11 | print(next(reduce(operator.mul, nums) 12 | for nums in itertools.combinations(input, n) 13 | if sum(nums) == 2020)) 14 | -------------------------------------------------------------------------------- /01/rb/01.rb: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env ruby 2 | 3 | input = File.readlines('input').map &:to_i 4 | 5 | # both parts 6 | [2, 3].each do |n| 7 | p input.combination(n).find{|nums| nums.sum == 2020}.inject :* 8 | end 9 | -------------------------------------------------------------------------------- /02/c/02.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int part1 = 0, part2 = 0; 5 | 6 | // both parts 7 | FILE *fp = fopen("input", "r"); 8 | int a, b, c; 9 | char pwd[100]; 10 | while (fscanf(fp, "%d-%d %c: %s\n", &a, &b, &c, &pwd) > 0) { 11 | int count = 0; 12 | for (char *ch = pwd; *ch; ++ch) *ch == c && ++count; 13 | if (a <= count && count <= b) ++part1; 14 | if ((pwd[a-1] == c) != (pwd[b-1] == c)) ++part2; 15 | } 16 | fclose(fp); 17 | 18 | printf("%d\n%d\n", part1, part2); 19 | } 20 | -------------------------------------------------------------------------------- /02/hs/02.hs: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env runhaskell 2 | 3 | parse :: String -> (Int, Int, Char, String) 4 | parse line = 5 | (read a, read $ drop 1 b, head ch, pwd) 6 | where [rng, ch, pwd] = words line 7 | (a, b) = span (/='-') rng 8 | 9 | part1 = length . filter part1' 10 | where part1' (a, b, ch, pwd) = between a b $ length $ filter (==ch) pwd 11 | between a b c = a <= c && c <= b 12 | 13 | part2 = length . filter part2' 14 | where part2' (a, b, ch, pwd) = (pwd !! pred a == ch) /= (pwd !! pred b == ch) 15 | 16 | main = do 17 | input <- map parse . lines <$> readFile "input" 18 | putStrLn . show $ part1 input 19 | putStrLn . show $ part2 input 20 | -------------------------------------------------------------------------------- /02/mma/02.mma: -------------------------------------------------------------------------------- 1 | input = First@*StringCases[ 2 | a__ ~~ "-" ~~ b__ ~~ " " ~~ c_ ~~ ": " ~~ d__ :> 3 | {ToExpression@a, ToExpression@b, c, d} 4 | ] /@ ReadList["~/code/misc/polyaoc-2020/02/input", String]; 5 | 6 | (* part 1 *) 7 | Print@Count[input, {a_, b_, c_, d_} /; a <= StringCount[d, c] <= b]; 8 | 9 | (* part 2 *) 10 | Print@Count[input, {a_, b_, c_, d_} /; Count[StringTake[d, {{a}, {b}}], c] == 1]; 11 | 12 | (* vim: ft=mma 13 | *) 14 | -------------------------------------------------------------------------------- /02/py/02.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env python3 2 | 3 | import re 4 | 5 | data = [(lambda a,b,c,d: [int(a), int(b), c, d])(*re.findall(r'\w+', line)) 6 | for line in open('input').readlines()] 7 | 8 | # part 1 9 | print(sum(a <= d.count(c) <= b for a,b,c,d in data)) 10 | 11 | # part 2 12 | print(sum((d[a-1] == c) != (d[b-1] == c) for a,b,c,d in data)) 13 | -------------------------------------------------------------------------------- /02/rb/02.rb: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env ruby 2 | 3 | input = File.readlines('input').map{|line| a,b,c,d = line.scan /\w+/; [a.to_i, b.to_i, c, d]} 4 | 5 | # part 1 6 | p input.count{|a,b,c,d| (a..b).include? d.count c} 7 | 8 | # part 2 9 | p input.count{|a,b,c,d| (d[a-1] == c) != (d[b-1] == c)} 10 | -------------------------------------------------------------------------------- /03/asm/03.s: -------------------------------------------------------------------------------- 1 | .set SIZE, 20000 2 | 3 | .section .data 4 | fname: .asciz "input" 5 | fmt: .asciz "%u\n" 6 | readmode: .asciz "r" 7 | 8 | .section .bss 9 | .lcomm data, SIZE 10 | 11 | .section .text 12 | .globl main 13 | 14 | main: 15 | 16 | # open input file 17 | movq $fname, %rdi 18 | movq $readmode, %rsi 19 | call fopen 20 | movq %rax, %rbx 21 | 22 | # read input into memory 23 | movq $data, %rdi 24 | movq $1, %rsi 25 | movq $SIZE, %rdx 26 | movq %rbx, %rcx 27 | call fread 28 | movl %eax, %ebp 29 | 30 | # close input file 31 | movq %rbx, %rdi 32 | call fclose 33 | 34 | # compute line length 35 | xorl %ebx, %ebx 36 | movq $data, %rcx 37 | lenloop: 38 | incl %ebx 39 | incq %rcx 40 | cmpb $10, (%rcx) 41 | jne lenloop 42 | 43 | # part 1 44 | movl $3, %edi 45 | movl $1, %esi 46 | call go 47 | movl %eax, %r12d # save for part 2 48 | 49 | movq $fmt, %rdi 50 | movl %eax, %esi 51 | xorl %eax, %eax 52 | call printf 53 | 54 | # part 2 55 | movl $1, %edi 56 | movl $1, %esi 57 | call go 58 | imull %eax, %r12d 59 | movl $5, %edi 60 | movl $1, %esi 61 | call go 62 | imull %eax, %r12d 63 | movl $7, %edi 64 | movl $1, %esi 65 | call go 66 | imull %eax, %r12d 67 | movl $1, %edi 68 | movl $2, %esi 69 | call go 70 | imull %eax, %r12d 71 | 72 | movq $fmt, %rdi 73 | movl %r12d, %esi 74 | xorl %eax, %eax 75 | call printf 76 | 77 | # done 78 | movl $60, %eax 79 | movl $0, %edi 80 | syscall 81 | 82 | # ebx stores line length 83 | # ebp stores total byte count 84 | # 85 | # edi is the x velocity 86 | # esi is the y velocity 87 | # 88 | # r8d is the current line number 89 | # r9d stores number of trees 90 | # r10 is just there to point to data, idk if there's a better way to do this 91 | go: 92 | 93 | xorl %r8d, %r8d 94 | xorl %r9d, %r9d 95 | movq $data, %r10 96 | 97 | treeloop: 98 | xorl %edx, %edx 99 | movl %r8d, %eax 100 | imull %edi, %eax 101 | divl %ebx # obtain (line num * x velocity) % line length in edx 102 | 103 | movl %ebx, %eax 104 | incl %eax 105 | imull %r8d, %eax 106 | imull %esi, %eax 107 | addl %eax, %edx # now add (line length + 1) * line num * y velocity 108 | 109 | cmpl %ebp, %edx # first check if it's in bounds 110 | jg done 111 | 112 | incl %r8d # (next line; goes here for nicer jumps below) 113 | 114 | cmpb $35, (%r10, %rdx) # now check if it's a tree 115 | jne treeloop 116 | incl %r9d 117 | jmp treeloop 118 | 119 | done: 120 | movl %r9d, %eax 121 | ret 122 | -------------------------------------------------------------------------------- /03/hs/03.hs: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env runhaskell 2 | 3 | go' dy dx input = 4 | length . filter id $ zipWith f (every dy input) [0..] 5 | where f x i = cycle x !! (dx*i) == '#' 6 | every n [] = [] 7 | every n xs@(x:_) = x:every n (drop n xs) 8 | 9 | go = go' 1 10 | 11 | main = do 12 | input <- lines <$> readFile "input" 13 | putStrLn . show $ go 3 input 14 | putStrLn . show $ product $ map ($ input) [go 1, go 3, go 5, go 7, go' 2 1] 15 | -------------------------------------------------------------------------------- /03/jl/03.jl: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env julia 2 | 3 | function go(input, dx, dy=1) 4 | sum(((y, line),) -> line[mod1(1 + dx*(y-1), length(line))] == '#', enumerate(input[1:dy:end])) 5 | end 6 | 7 | input = readlines("input") 8 | 9 | println(go(input, 3)) 10 | println(prod(x -> go(input, x...), [1, 3, 5, 7, [1, 2]])) 11 | -------------------------------------------------------------------------------- /03/rb/03.rb: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env ruby 2 | 3 | @input = open('input').readlines.map &:chomp 4 | 5 | def go dx, dy = 1 6 | @input.each_slice(dy).map.with_index{|line, y| line[0][(y*dx) % line[0].size] == ?#}.count true 7 | end 8 | 9 | # part 1 10 | p go 3 11 | 12 | # part 2 13 | p [1, 3, 5, 7, [1, 2]].map{|a| go *a}.inject :* 14 | -------------------------------------------------------------------------------- /03/rs/03.rs: -------------------------------------------------------------------------------- 1 | use std::fs::File; 2 | use std::io::{self, BufRead}; 3 | 4 | fn go(input: &[String], dx: usize, dy: usize) -> usize { 5 | input.iter().step_by(dy).enumerate() 6 | .filter(|(y, line)| line.chars().cycle().nth(dx*y) == Some('#')).count() 7 | } 8 | 9 | fn main() -> io::Result<()> { 10 | let f = File::open("input")?; 11 | let input: Vec = io::BufReader::new(f).lines().flatten().collect(); 12 | 13 | println!("{}", go(&input, 3, 1)); 14 | println!("{}", [(1,1),(3,1),(5,1),(7,1),(1,2)] 15 | .iter().map(|&(dx,dy)| go(&input, dx, dy)).product::()); 16 | 17 | Ok(()) 18 | } 19 | -------------------------------------------------------------------------------- /04/rb/04.rb: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env ruby 2 | 3 | part1 = part2 = 0 4 | 5 | def year s, e; ->x{ x =~ /^\d\d\d\d$/ && (s..e) === x.to_i }; end 6 | reqs = { 7 | 'byr' => year(1920, 2002), 8 | 'iyr' => year(2010, 2020), 9 | 'eyr' => year(2020, 2030), 10 | 'hgt' => ->x{ x =~ /^\d+cm$/ && (150..193) === x.to_i || x =~ /^\d+in$/ && (59..76) === x.to_i }, 11 | 'hcl' => /^#[\da-f]{6}$/.method(:match?), 12 | 'ecl' => %w[amb blu brn gry grn hzl oth].method(:include?), 13 | 'pid' => /^\d{9}$/.method(:match?) 14 | } 15 | 16 | File.open('input').read.split("\n\n").each do |rcd| 17 | hsh = rcd.split.map{|x| x.split ?:}.to_h 18 | part1 += 1 if reqs.all?{|k,v| hsh[k]} 19 | part2 += 1 if reqs.all?{|k,v| hsh[k] && v[hsh[k]]} 20 | end 21 | 22 | p part1, part2 23 | -------------------------------------------------------------------------------- /05/c/05.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | FILE *fp = fopen("input", "r"); 5 | 6 | char seen[0x400] = {0}, line[11]; 7 | int max = 0; 8 | while (fread(line, 1, 11, fp)) { 9 | int val = 0; 10 | for (char *c = line; *c != '\n'; ++c) { 11 | val *= 2; 12 | val += (*c == 'B') + (*c == 'R'); 13 | } 14 | seen[val] = 1; 15 | val > max && (max = val); 16 | } 17 | 18 | fclose(fp); 19 | 20 | // part 1 21 | printf("%d\n", max); 22 | 23 | // part 2 24 | char *ptr = seen; 25 | while (!*ptr) ++ptr; 26 | while (*ptr) ++ptr; 27 | printf("%d\n", ptr - seen); 28 | } 29 | -------------------------------------------------------------------------------- /05/hs/05.hs: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env runhaskell 2 | 3 | import Data.List 4 | 5 | conv = sum . zipWith (*) (iterate (*2) 1) . reverse . map tr 6 | where tr 'F' = 0 7 | tr 'B' = 1 8 | tr 'L' = 0 9 | tr 'R' = 1 10 | 11 | part1 = last 12 | 13 | part2 (a:b:xs) 14 | | a+2 == b = a+1 15 | | otherwise = part2 (b:xs) 16 | 17 | main = do 18 | input <- sort . map conv . lines <$> readFile "input" 19 | putStrLn . show $ part1 input 20 | putStrLn . show $ part2 input 21 | -------------------------------------------------------------------------------- /05/jy/05_1.jy: -------------------------------------------------------------------------------- 1 | ỴO%7ḂḄṀ 2 | -------------------------------------------------------------------------------- /05/jy/05_2.jy: -------------------------------------------------------------------------------- 1 | ỴO%7ḂḄṢµṂrṀḟ 2 | -------------------------------------------------------------------------------- /05/rb/05.rb: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env ruby 2 | 3 | seats = File.readlines('input').map{|x| x.tr('FBLR', '0101').to_i 2 } 4 | 5 | p seats.max 6 | p seats.sort.each_cons(2).find{|a,b| a+1 != b }.sum / 2 7 | -------------------------------------------------------------------------------- /05/sh/05.sh: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env bash 2 | 3 | # outputs the two parts in reverse order 4 | 5 | tr FBLR 0101 p\" 8 | g/\v^(.*) \1/d 9 | norm kdwddp 10 | -------------------------------------------------------------------------------- /06/hs/06.hs: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env runhaskell 2 | 3 | import Data.List 4 | 5 | go [] _ = 0 6 | go xs f = length (foldl1 f vals) + go (drop 1 rest) f 7 | where (vals, rest) = break null xs 8 | 9 | main = do 10 | input <- lines <$> readFile "input" 11 | putStrLn . show $ map (go input) [union, intersect] 12 | -------------------------------------------------------------------------------- /06/ijs/06.ijs: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env jconsole 2 | 3 | input =. (LF,LF) splitstring 1!:1 <'input' 4 | 5 | echo +/> ([:# LF -.~ ~.) each input 6 | echo +/> ([:# [:(e.#[)/ [:> LF cutopen ]) each input 7 | 8 | exit 0 9 | -------------------------------------------------------------------------------- /06/rb/06.rb: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env ruby 2 | 3 | input = File.read('input').split("\n\n").map{|x| x.lines.map{|line| line.chomp.chars}} 4 | 5 | puts [:|, :&].map{|sym| input.map{|x| x.reduce(sym).size}.sum} 6 | -------------------------------------------------------------------------------- /07/rb/07.rb: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env ruby 2 | 3 | require 'set' 4 | 5 | hsh = {} 6 | File.readlines('input').each do |line| 7 | next if line =~ /no other/ 8 | line =~ /(.*) bags contain (.*)./ 9 | hsh[$1] = $2.split(', ').map{|x| x.sub(/ bags?/, '').split ' ', 2} 10 | end 11 | 12 | def part1 hsh, bag 13 | hsh.select{|k, v| v.include? bag}.map{|k, v| part1 hsh, k}.reduce(Set[bag], :+) 14 | end 15 | 16 | def part2 hsh, bag 17 | hsh[bag] ? hsh[bag].sum{|n, x| n.to_i * (1 + part2(hsh, x))} : 0 18 | end 19 | 20 | p part1(hsh.transform_values{|x| x.map &:last}, 'shiny gold').size - 1 21 | p part2 hsh, 'shiny gold' 22 | -------------------------------------------------------------------------------- /08/hs/08.hs: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env runhaskell 2 | 3 | import Control.Arrow 4 | import Data.List 5 | import Data.Maybe 6 | 7 | a !!! n = head' $ drop n a 8 | where head' [] = Nothing 9 | head' (x:_) = Just x 10 | 11 | data Instr = Acc | Jmp | Nop 12 | parse = (readIns *** readNum) . break (==' ') 13 | where readIns "acc" = Acc 14 | readIns "jmp" = Jmp 15 | readIns "nop" = Nop 16 | readNum (' ':'+':n) = read n 17 | readNum (' ':'-':n) = -read n 18 | 19 | data Result = Looped | Oob Int deriving Eq 20 | run = run' 0 0 . flip zip (repeat False) 21 | where run' ip acc code = case code !!! ip of 22 | Nothing -> (Oob ip, acc) 23 | Just (_, True) -> (Looped, acc) 24 | Just ((Acc, n), _) -> run' (ip+1) (acc+n) $ hit ip code 25 | Just ((Jmp, n), _) -> run' (ip+n) acc $ hit ip code 26 | Just ((Nop, n), _) -> run' (ip+1) acc $ hit ip code 27 | hit 0 ((x,_):code) = (x, True):code 28 | hit n (x:code) = x:hit (n-1) code 29 | 30 | runSwap :: [(Instr, Int)] -> Int -> Maybe (Result, Int) 31 | runSwap = ((fmap run) .) . swap 32 | where swap ((Acc, n):code) 0 = Nothing 33 | swap ((Jmp, n):code) 0 = Just ((Nop, n):code) 34 | swap ((Nop, n):code) 0 = Just ((Jmp, n):code) 35 | swap (x:code) n = (x:) <$> swap code (n-1) 36 | 37 | main = do 38 | code <- map parse . lines <$> readFile "input" 39 | putStrLn . show . snd $ run code 40 | putStrLn . show . snd . fromJust . find ((== Oob (length code)) . fst) $ 41 | mapMaybe (runSwap code) [0..] 42 | -------------------------------------------------------------------------------- /08/rb/08.rb: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env ruby 2 | 3 | def run code, idx=nil 4 | if idx 5 | return if code[idx][0] == 'acc' 6 | code = code.map &:dup 7 | code[idx][0] = code[idx][0] == 'jmp' ? 'nop' : 'jmp' 8 | end 9 | 10 | executed = code.map{false} 11 | i = 0 12 | acc = 0 13 | loop { 14 | if i == code.length 15 | puts acc 16 | return :eof 17 | end 18 | return acc if executed[i] 19 | executed[i] = true 20 | case code[i][0] 21 | when 'acc' then acc += code[i][1]; i += 1 22 | when 'jmp' then i += code[i][1] 23 | when 'nop' then i += 1 24 | end 25 | } 26 | end 27 | 28 | code = File.readlines('input').map{|line| a, b = line.split; [a, b.to_i]} 29 | 30 | # part 1 31 | p run code 32 | 33 | # part 2 34 | (0..).find{|i| run(code, i) == :eof} 35 | -------------------------------------------------------------------------------- /09/hs/09.hs: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env runhaskell 2 | 3 | import Data.List 4 | import Data.Maybe 5 | 6 | part1 input 7 | | val `elem` sums (take 25 input) = part1 $ tail input 8 | | otherwise = val 9 | where val = input !! 25 10 | sums a = [x+y | (x:xs) <- tails a, y <- xs] 11 | 12 | part2 = part2' 0 0 13 | where part2' sum count input val 14 | | sum < val = part2' (sum + input!!count) (count+1) input val 15 | | sum > val = part2' (sum - head input) (count-1) (tail input) val 16 | | otherwise = (+) <$> minimum <*> maximum $ take count input 17 | 18 | main = do 19 | input <- map read . lines <$> readFile "input" 20 | let val = part1 input 21 | putStrLn . show $ val 22 | putStrLn . show $ part2 input val 23 | -------------------------------------------------------------------------------- /09/rb/09.rb: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env ruby 2 | 3 | input = File.readlines('input').map &:to_i 4 | 5 | # part 1 6 | val = input.each_cons(26).find{|*a, n| !a.combination(2).map(&:sum).include?(n)}.last 7 | p val 8 | 9 | # part 2 10 | start, stop, sum = 0, 0, input[0] 11 | while sum != val 12 | if sum < val 13 | stop += 1 14 | sum += input[stop] 15 | else 16 | sum -= input[start] 17 | start += 1 18 | end 19 | end 20 | p input[start..stop].minmax.sum 21 | -------------------------------------------------------------------------------- /09/rkt/09.rkt: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env racket 2 | 3 | #lang racket 4 | 5 | (define input (map string->number (file->lines "input"))) 6 | 7 | (define (part1 input) 8 | (let ([val (list-ref input 25)]) 9 | (if 10 | (member val (map (curry apply +) (combinations (take input 25) 2))) 11 | (part1 (cdr input)) 12 | val))) 13 | 14 | (define (part2 input val) 15 | (define (helper input val num sum) 16 | (cond 17 | [(< sum val) (helper input val (add1 num) (+ sum (list-ref input num)))] 18 | [(> sum val) (helper (cdr input) val (sub1 num) (- sum (car input)))] 19 | [else (let ([slice (take input num)]) (+ (apply min slice) (apply max slice)))])) 20 | (helper input val 0 0)) 21 | 22 | (let ([val (part1 input)]) 23 | (println val) 24 | (println (part2 input val))) 25 | -------------------------------------------------------------------------------- /10/jl/10.jl: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env julia 2 | 3 | input = sort!(parse.(Int, eachline("input"))) 4 | pushfirst!(input, 0) # well aren't you cool and different, julia 5 | push!(input, input[end]+3) 6 | 7 | # part 1 8 | diffs = diff(input) 9 | println(count(diffs .== 1) * count(diffs .== 3)) 10 | 11 | # part 2 12 | const memo = Dict{Int,Int}() 13 | function ways(n) 14 | n ∉ input ? 0 : 15 | n == input[end] ? 1 : 16 | get!(() -> sum(ways, n+1:n+3), memo, n) 17 | end 18 | println(ways(0)) 19 | -------------------------------------------------------------------------------- /10/mma/10.mma: -------------------------------------------------------------------------------- 1 | input = Sort@ReadList@"input" /. {a__, b_} -> {0, a, b, b + 3}; 2 | 3 | (* part 1 *) 4 | Times @@ Values@(Counts@Differences@input)[[Key /@ {1, 3}]] // Print; 5 | 6 | (* part 2 *) 7 | get[Last@input] = 1; 8 | get[x_?(Curry[FreeQ, 2]@input)] = 0; 9 | get[x_] := get[x] = Sum[get[x+y], {y, 3}]; 10 | Print@get@0; 11 | 12 | (* vim: ft=mma 13 | *) 14 | -------------------------------------------------------------------------------- /10/rb/10.rb: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env ruby 2 | 3 | arr = File.readlines('input').map(&:to_i).sort 4 | arr.unshift 0 5 | arr.push arr[-1]+3 6 | 7 | # part 1 8 | diffs = arr.each_cons(2).map{|x,y| y-x} 9 | p diffs.count(1) * diffs.count(3) 10 | 11 | # part 2 12 | memo = {} 13 | define_method 'get' do |val| 14 | return 0 unless arr.include? val 15 | return 1 if val == arr[-1] 16 | memo[val] ||= get(val+1) + get(val+2) + get(val+3) 17 | end 18 | p get 0 19 | -------------------------------------------------------------------------------- /11/rb/11.rb: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env ruby 2 | 3 | seats = File.readlines('input').map{|x| [?*, *x.chomp.chars, ?*]} 4 | tmp = seats[0].map{?*} 5 | seats.unshift tmp 6 | seats.push tmp 7 | 8 | adj8 = [-1,0,1].product([-1,0,1]) - [[0,0]] 9 | 10 | sight = seats.map.with_index{|row,i| row.map.with_index{|seat,j| 11 | seat != ?* && adj8.map{|dx,dy| 12 | x,y = i+dx, j+dy 13 | (x+=dx) && (y+=dy) while seats[x][y] == ?. 14 | [x-i,y-j] 15 | } 16 | }} 17 | 18 | define_method 'part' do |pt| 19 | arr = seats.map &:dup 20 | 21 | while (new = arr.map.with_index{|row,i| row.map.with_index{|seat,j| 22 | if seat == ?L || seat == ?# 23 | num = (pt == 1 ? adj8 : sight[i][j]).count{|dx,dy| arr[i+dx][j+dy] == ?#} 24 | seat == ?L ? (num == 0 ? ?# : ?L) : (num >= (pt == 1 ? 4 : 5) ? ?L : ?#) 25 | else 26 | seat 27 | end 28 | }}) != arr 29 | arr = new 30 | end 31 | 32 | p arr.sum{|row| row.count ?#} 33 | end 34 | 35 | part 1 36 | part 2 37 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | all years: 2 | [polyaoc-2019](https://github.com/tckmn/polyaoc-2019), 3 | [polyaoc-2020](https://github.com/tckmn/polyaoc-2020), 4 | [polyaoc-2021](https://github.com/tckmn/polyaoc-2021), 5 | [polyaoc-2023](https://github.com/tckmn/polyaoc-2023), 6 | [polyaoc-2024](https://github.com/tckmn/polyaoc-2024) 7 | 8 | (these languages are, in order: x64 assembly, C, Haskell, J, Julia, JavaScript, Jelly, Mathematica, Python, Ruby, Racket, Rust, bash, vim) 9 | 10 | | | asm | c | hs | ijs | jl | js | jy | mma | py | rb | rkt | rs | sh | vim | 11 | | - | - | - | - | - | - | - | - | - | - | - | - | - | - | - | 12 | | 01 | | [✓][01c] | [✓][01hs] | | | [✓][01js] | | [✓][01mma] | [✓][01py] | [✓][01rb] | | | | | 13 | | 02 | | [✓][02c] | [✓][02hs] | | | | | [✓][02mma] | [✓][02py] | [✓][02rb] | | | | | 14 | | 03 | [✓][03asm] | | [✓][03hs] | | [✓][03jl] | | | | | [✓][03rb] | | [✓][03rs] | | | 15 | | 04 | | | | | | | | | | [✓][04rb] | | | | | 16 | | 05 | | [✓][05c] | [✓][05hs] | | | | [✓][05jy] | | | [✓][05rb] | | | [✓][05sh] | [✓][05vim] | 17 | | 06 | | | [✓][06hs] | [✓][06ijs] | | | | | | [✓][06rb] | | | | | 18 | | 07 | | | | | | | | | | [✓][07rb] | | | | | 19 | | 08 | | | [✓][08hs] | | | | | | | [✓][08rb] | | | | | 20 | | 09 | | | [✓][09hs] | | | | | | | [✓][09rb] | [✓][09rkt] | | | | 21 | | 10 | | | | | [✓][10jl] | | | [✓][10mma] | | [✓][10rb] | | | | | 22 | | 11 | | | | | | | | | | [✓][11rb] | | | | | 23 | 24 | how to run the programs: 25 | 26 | * for jy, run `jelly fun jy/##.jy "$(