r/drama Advent of Code S02E01 - Official DISCUSSION Thread

HI PEOPLE HERE FROM THE STICKY

DONT WORRY ABOUT BEING LATE. LAST YEAR FINISHING EVERY DAY AT ALL WAS ALREADY TOP 10 PRETTY MUCH

JUST GET IT NOW AND DO IT WHEN YOU HAVE TIME

Alrighty, enough solutions have been posted that this won't be a major spoiler anymore.

Here's a nice, clean, Pythonic solution:

from num2words import num2words as n2w
𝓜 = {𝓕(𝓭):𝓭 for 𝓕 in [n2w,str] for 𝓭 in range(10)}
屎 = lambda 鲤: [(屙(鲤,屁), 𝓜[屁]) for 屙 in [str.find,str.rfind] for 屁 in 𝓜 if 屁 in 鲤]
ඞ = lambda ම: min(ම)[1]*10+max(ම)[1]
print(sum(ඞ(屎(𝓛)) for 𝓛 in open('feed&seed.txt').readlines()))

bash chads stay winning hahahahaha you fricking losers

score = sum([int(''.join((lambda digits : (digits[0], digits[-1]))([char for char in line if char.isdigit()]))) for line in lines])

one line of pure python

edit apparently there are two parts

also did part 2 in one line

print(sum([int(''.join((lambda digits : (digits[0], digits[-1]))([number for number, index in sorted([item for sublist in [get_matches(line, number_pair) for number_pair in [(str(i+1), str(i+1)) for i in range(10)]+[(string, str(i+1)) for i, string in enumerate(['one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight', 'nine'])]] for item in sublist], key=lambda a : a[1])]))) for line in lines]))

I got both puzzles but don't laugh at my solution for the 2nd one

I've been very, very slowly teaching myself Python after learning Matlab at college

My solution is nothing special (maybe a little bit inefficient but who cares)

@L this can be used to generate images of code https://carbon.vercel.app

r←⊃⎕NGET'i1.txt'1
d←'one' 'two' 'three' 'four' 'five' 'six' 'seven' 'eight' 'nine'
f←{+/⍎¨(1∘↑,¯1∘↑)¨(∊∘⎕d⊢⍤/⊢)¨⍵}
g←{m←+/¨p←⍷∘⍵¨d ⋄ (m/'123456789')@(∊(⊢⊢⍤/⍳∘≢)¨p)⊢⍵}
⎕←f r ⋄ ⎕←f g¨r

Got ugly once I spotted the portmaeaus

Regex is king:

Side note: Nim has a nice bit of syntactic sugar for matching regexes:

import std/re
let regex = re".*?(drama)"
const text = "rdrama.net"
if text =~ regex:
   echo matches[0] # prints "drama"

However, it will only use an existing matches array if it's declared in the enclosing scope, not any scopes above it. This means the array would be recreated every loop cycle, making it several times slower

Maybe c++ is not the right choice for this.

was nice that he threw in the "word numbers can actually be portmanteaus" bit cause it made it not braindead, but i feel like there will be a lot more of this trickery

oh wait i didnt even use islice after all

vomited the ugliest, least efficient or concise or consistent code I could and I was still so SLOW

<4 mins for p1 and 34 mins for p2

Wait the rankings are based on time that is so f****** gay I'd have to get up at like 1:00 in the morning to compete f*** that

Am I just r-slurred or is there not enough information for the second part? I don't know if characters can be reused or not, IE is eightwo interpreted as 82 or 8wo

std::string fan vs std::string_view enjoyer

1/5 Imma just read the file and add them all up

Fear my shitcode. Sepples returning -1 on not finding stuff fricked me for the longest time and I kept adding bloat trying to compensate for things I thought might be causing the issue

Got it working though, I'm shaking the rust off bros

Took me a long time to remember to do this but I beat the release of day two :)

I bounced off haskell immediately and cbf re-learning from scratch so it's rust season again:

// line, head, tail, recursive
fn part2(line: String, first: Option<char>, last: Option<char>) -> String {
   let mut new_first = first;
   let mut new_last = last;

   if line.len() == 0 {
       return format!("{}{}", first.unwrap(), last.unwrap());
   } else {
       for p in [
           ("one", '1'),
           ("two", '2'),
           ("three", '3'),
           ("four", '4'),
           ("five", '5'),
           ("six", '6'),
           ("seven", '7'),
           ("eight", '8'),
           ("nine", '9'),
       ] {
           if line.starts_with(p.0) {
               if first.is_none() {
                   new_first = Some(p.1);
               }
               new_last = Some(p.1);
               break;
           }
       }

       let mut ln_new = line.chars();
       let c = ln_new.next().unwrap();
       if c.is_digit(10) {
           if first.is_none() {
               new_first = Some(c);
           }
           new_last = Some(c);
       }

       return part2(ln_new.collect(), new_first, new_last);
   }
}

fn main() {
   // Part One
   let lines = include_str!("input.txt").lines().collect::<Vec<_>>();
   let mut n = 0;
   for line in lines.clone() {
       let mut first: Option<char> = None;
       let mut last: Option<char> = None;
       for c in line.chars() {
           if c.is_digit(10) {
               if first.is_none() {
                   first = Some(c);
               }
               last = Some(c);
           }
       }

       n += format!("{}{}", first.unwrap(), last.unwrap())
           .parse::<i32>()
           .unwrap();
   }

   println!("Part 1: {}", n);

   // Part Two
   let mut m = 0;
   for line in lines {
       m += part2(line.to_string(), None, None).parse::<i32>().unwrap();
   }

   println!("Part 2: {}", m);
}

Ugly but it works.

# Part One
with open("1.txt") as infile:
   data = infile.read()

total = 0
for line in data.splitlines():
   digits = [c for c in line if c.isdigit()]
   v = int(digits[0]+ digits[-1])
   total += v
print(total)

# Part Two
import re

words = ['zero','one','two','three','four','five','six','seven','eight','nine']
ws = '|'.join(words)
pat = re.compile(fr'(?=({ws}|\d))')
total = 0
for line in data.splitlines():
   g = pat.findall(line)
   a, b = g[0], g[-1]
   v = str(a if a.isdigit() else words.index(a)) + str(b if b.isdigit() else words.index(b))
   total += int(v)
print(total)

Post your coding atrocities below.

You would like to know my secrets, wouldn't you, filthy silvercel?

what is this btw

Oh shit, it's that time of the year already?

Python was too easy last year, so this time I'm using C++.

#include <iostream>
#include <fstream>
#include <string>
#include <vector>

using std::string;
using std::ifstream;
using std::cout;
using std::vector;

auto main(int argc, char * argv[]) -> int
{
   ifstream readfile("day1_input.txt");
   string readline;
   vector<string> num_strings{"one", "two", "three", "four", "five", "six", "seven", "eight", "nine"};
   int result = 0;

   while(getline(readfile, readline)){
       char first = 'x';
       char second = 'x';
       readline = readline.substr(0, readline.size()-1);

       for(int i=0;i<readline.size();i++) {
           if(readline[i] < 97 || readline[i] > 122\. {
               first = readline[i];
               break;
           }
           else {
               for (int n=0;n<num_strings.size();n++)
                   if((i + num_strings[n].size()) <= readline.size() && readline.substr(i, num_strings[n].size()) == num_strings[n]) {
                       first = '0' + (n+1);
                       break;
                   }
               if (first != 'x') break;
           }
       }
       for(int i=readline.size()-1;i>=0;i--) {
           if(readline[i] < 97 || readline[i] > 122\. {
               second = readline[i];
               break;
           }
           else {
               for (int n=0;n<num_strings.size();n++)
                   if((i + num_strings[n].size()) <= readline.size() && readline.substr(i, num_strings[n].size()) == num_strings[n]) {    
                       second = '0' + (n+1);
                       break;
                   }
               if (second != 'x') break;
           }
       }
       string concat = string{first, second};
       result += std::stoi(concat);
   }
   cout << result << '\n';
}

  .-""-.
 /,..___\
() {_____}
  (/-@-@-\)
  {`-=^=-'}
  {  `-'  } Merry Fistmas!
   {     }
    `---'

It's nothing good. I'm trying to learn a faster language and I picked Rust because I really like their package manager. I'd rather use C tbh, I've tried it before and prefer it, but everytime I try to use Cmake I have the urge to kill whoever designed it.

I might go back and do the second part later