advent of code day 3: i might be r-slurred edition

here's my... verbose solution (debugging code removed)

from string  import ascii_lowercase, ascii_uppercase
from y2022.scaffold import *

class Day03(Day):
	def __init__(self):
		super()
	
	@property
	def day(self): return  3

	def prepare_data(self) -> Any:
		return [(take(x, int(len(x) / 2)), skip(x, int(len(x) / 2))) for x in self.get_data().split('\n')]

	def prepare_data2(self) -> Any:
		return self.get_data().split('\n')

	PRIORITIES = {}

	def a(self):
		data = self.prepare_data()
		y = 1
		for x in ascii_lowercase:
			self.PRIORITIES[x] = y
			y += 1
		for x in ascii_uppercase:
			self.PRIORITIES[x] = y
			y += 1
		sum = 0
		for sack in data:
			if len(sack[0]) == 0: continue
			item3 = None
			found = False
			for item in sack[0]:
				for item2 in sack[1]:
					if item == item2:
						item3 = item
						found = True
						break
				if found: break
			sum += self.PRIORITIES[item3]
		print(sum)
	
	def b(self):
		data = self.prepare_data2()
		i = 0
		sack1 = None
		sack2 = None
		sack3 = None
		item = None
		sum = 0
		for i in range(0, len(data) - 3, 3):
			sack1 = data[i]
			sack2 = data[i + 1]
			sack3 = data[i + 2]
			for x in sack1:
				if not x in sack2: continue
				if not x in sack3: continue
				item = x
				break
			sum += self.PRIORITIES[item]
		print(sum)

Imagine not doing it in k you fucking retards:

l"i.txt"
i:{x^x^y}
t:+/(58!-96+)'
t@(*i/2 0N#)'l
t@(*i/)'0N 3#l

Le edit: WHY DOES CODEBLOCKS HAVE EMOJIS ENABLED @Jinglevann YOU FUCKING RETARD NO WONDER YOU CODE IN PYTHON

Part 1:

print(sum([set([a - 0x60 if a > 0x60 else a - 0x26 for a in bytes(l[0:int(len(l)/2)],'ascii') if a in bytes(l[int(len(l)/2):],'ascii')]).pop() for l in open('resources/day3.txt').readlines()]))

Basically the same as Geese's grugbrained tbh. … ALSO: Once again wondering who 986674 and 2339424 are

def _priority(self, itm):
    if ord(itm) > ord('Z'):
        return ord(itm) - ord('a') + 1
    return ord(itm) - ord('A') + 27

def run_a(self, data):
    acc = 0
    for l in data:
        sz = len(l) // 2
        ca, cb = l[0:sz], l[sz:len(l)]
        for x in ca:
            if x in cb:
                acc += self._priority(x)
                break
    return acc

def run_b(self, data):
    acc = 0
    for i in range(len(data) // 3):
        for x in data[3*i]:
            if x in data[3*i + 1] and x in data[3*i + 2]:
                acc += self._priority(x)
                break
    return acc

ord() + offset

letters = ['','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z', 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']

First 3 days in GNU APL:

⍝ ~~~ Day 1 ~~~ ⍝

r←⊢⎕FIO[49] 'day1raw.txt'
e←+/¨⍎¨¨r⊂⍨,⍉⊃0≠⍴¨r ⋄ ⌈/e ⋄ +/3↑e⌷⍨⊂⍒e

⍝ ~~~ Day 2 ~~~ ⍝

k←⊂(,'ABC'∘.{⍺' '⍵}'XYZ')⍳⊢⎕FIO[49]'2'
+/k⌷4 8 3 1 5 9 7 2 6 ⋄ +/k⌷3 4 8 1 5 9 2 6 7

⍝ ~~~ Day 3 ~~~ ⍝

r←⊢⎕FIO[49] 'day3raw.txt'
p←'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'
+/p⍳↑¨({⍵↑⍨2÷⍨⍴⍵}¨r)∩¨{⍵↑⍨2÷⍨⍴⍵}¨⌽¨r ⋄ +/p⍳↑¨⊃∩/¨r⊂⍨3/⍳↑3÷⍨⍴r

mine was similar

import string

TRANS_LIVES_MATTER = [None]
TRANS_LIVES_MATTER.extend(letter for letter in string.ascii_lowercase)
TRANS_LIVES_MATTER.extend(letter for letter in string.ascii_uppercase)

with open("day3input.txt") as f:
    rucksacks = f.read().split("\n")

# task 1

value = 0

for rucksack in rucksacks:
    i = int(len(rucksack)/2)
    compartments = (rucksack[:i], rucksack[i:])
    for item in compartments[0]:
        if item in compartments[1]:
            value += TRANS_LIVES_MATTER.index(item)
            break

print(value)

# task 2

value = 0

for i in range(0, len(rucksacks), 3):
    group = tuple(set(rucksack) for rucksack in rucksacks[i:i+3])
    badge = ("".join(group[0].intersection(group[1], group[2])))
    value += TRANS_LIVES_MATTER.index(badge)

print(value)

c++ Part one

int charToPriority(char c)
{
    if (c >= 'a' && c <= 'z') return c - 'a' + 1;
    if (c >= 'A' && c <= 'Z') return c - 'A' + 27;
}

char priorityToChar(int c) {
    if (c < 27) return c + 'a' - 1;
    return c + 'A' - 27;
}

int partOne()
{
    std::cout << "Day 3" << '\n';

    std::ifstream file("input.txt");
    std::string line;

    int score{ 0 };


    while (std::getline(file, line)) {
        std::unordered_map<char int=""> left;
        int n = line.size();
        for (int i{ 0 }; i < n / 2; i++) {
            if (!left[line[i]]) left[line[i]] = 1;
        }
        for (int j = n / 2; j < n; j++) {
            if (left[line[j]] > 0) {
                score += charToPriority(line[j]);
                left[line[j]]--;
            }
        }
    }

    file.close();
    
    return score;
}

</char>

Part two

int partTwo()
{
    std::cout << "Day 3 Part Two" << '\n';

    std::ifstream file("input.txt");
    std::string elf1;
    std::string elf2;
    std::string elf3;

    int score{ 0 };

    while (std::getline(file, elf1)std::getline(file, elf3)) {
        std::vector<int> storage(52);

        for (char c : elf1) storage[charToPriority(c) - 1] |= 0b001;
        for (char c : elf2) storage[charToPriority(c) - 1] |= 0b010;
        for (char c : elf3) {
            storage[charToPriority(c) - 1] |= 0b100;
            if (storage[charToPriority(c) - 1] == 0b111) {
                score += charToPriority(c);
                break;
            }
        }
    }

    file.close();

    return score;
}
</int>

Maybe i should just have just taken the o(n^2) pill and do it with 'in'.

Still pretty easy, these get hard in week two right? I've usually forgotten that I've sworn that it was definitely happening this year by then. Can't get the code formatting right so I'm pasting the screenshot.

LONG POST ALERT, I'm actually kind of proud of the "contains" subfunction

package three

import (
	"bufio"
	"bytes"
	"fmt"
	"os"
)

func pos(ch byte) int {
	var alph string = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"

	return (bytes.IndexByte([]byte(alph), ch) + 1)
}

func One() int {
	var deliver int

	fp, _ := os.Open("three.txt")
	defer fp.Close()

	rd := bufio.NewScanner(fp)

	for rd.Scan() {
		line := rd.Text()
		item_len := len(line) / 2
		left := make([]byte, item_len)
		right := make([]byte, item_len)

		for i, v := range line {
			if i < item_len {
				left[i] = byte(v)
			} else {
				i %= item_len
				right[i] = byte(v)
			}
		}

		for i, v := range left {
			if bytes.ContainsRune(right, rune(v)) {
				deliver += pos(left[i])
				break
			}
		}
	}

	return deliver
}

func Two() int {
	var deliver int
	elf := make(map[int]string)

	fp, _ := os.Open("three.txt")
	defer fp.Close()

	rd := bufio.NewScanner(fp)

	for e := 0; rd.Scan(); e++ {
		elf[e] = rd.Text()
	}

	contains := func(a string, b string, c string) (byte, error) {
		var master string
		var children []string

		if len(a) > len(b) && len(a) > len(c) {
			master = a
			children = []string{b, c}
		} else if len(b) > len(a) && len(b) > len(c) {
			master = b
			children = []string{a, c}
		} else {
			master = c
			children = []string{a, b}
		}

		for _, v := range master {
			var a_common, b_common byte

			if bytes.ContainsRune([]byte(children[0]), v) {
				a_common = byte(v)
			}
			if bytes.ContainsRune([]byte(children[1]), v) {
				b_common = byte(v)
			}

			if a_common == b_common && a_common > 0 {
				return a_common, nil
			}
		}

		return 'a', fmt.Errorf("no common????")
	}

	var elf_head int

	for g := 0; g < (len(elf) / 3); g++ {

		common, err := contains(elf[elf_head], elf[elf_head+1], elf[elf_head+2])

		if err == nil {
			deliver += pos(common)
		}

		elf_head += 3
	}

	return deliver
}

static inline unsigned getPriority(char elem)
{
	if(elem >= 'a' and elem <= 'z')
		return elem - 'a' + 1;
	
	if(elem >= 'A' and elem <= 'Z')
		return elem - 'A' + 27;
	
	abort();
	return 0;
}

static inline std::vector<char> toVec(const std::string &str)
{
	std::vector<char> t;

	for (char const &c: str)
		t.push_back(c);


	std::sort(t.begin(), t.end());
	t.erase( unique( t.begin(), t.end() ), t.end() );

	return t;
}

int main()
{
	std::string rucksack;
	unsigned long long points = 0;
	size_t index = 0;
	std::vector<char> group_sacks[3];

	while(std::cin >> rucksack)
	{
		group_sacks[index] = toVec(rucksack);
		auto secondComp = toVec(rucksack.substr(rucksack.length() / 2));

		if(index == 2)
		{
			std::vector<char> i1, i2;
			std::set_intersection(
				group_sacks[0].begin(), group_sacks[0].end(),
				group_sacks[1].begin(), group_sacks[1].end(), 
				std::back_inserter(i1));
			
			std::set_intersection(
				group_sacks[2].begin(), group_sacks[2].end(),
				i1.begin(), i1.end(), 
				std::back_inserter(i2));
			
			for(char c: i2)
				points += getPriority(c);

			index = 0;
		}
		else
			index ++;
	}

	std::cout << points << std::endl;
}

Lol imagine using (((python)))

#include <stdio.h>

int main(void){
	FILE *f = fopen("input.txt","r");
	char buffer1[1024],buffer2[1024],buffer3[1024];
	int sum = 0;
	while(fgets(buffer1,1024,f) != NULL){
	fgets(buffer2,1024,f);
	fgets(buffer3,1024,f);
		int end1=0,end2=0,end3=0;
		while(buffer1[end1] != '\n')
			end1++;
		while(buffer2[end2] != '\n')
			end2++;
		while(buffer3[end3] != '\n')
			end3++;
		int done = 0;
		for(int i=0;i<=end1 && done == 0;i++){
			for(int j=0;j<=end2 && done == 0;j++){
				for(int k=0;k<=end3 && done == 0;k++){
					if(buffer1[i] == buffer2[j] && buffer1[i] == buffer3[k]){
						char q = buffer1[i];
						if( q >= 'A' && q <= 'Z' )
							sum += q - 38;
						else
							sum += q - 96;
						done = 1;
					}
				}
			}
		}
		
	}
	printf("%d\n",sum);
	fclose(f);
	return 0;
}

Allah help me I have once again done some retarded shit

def priority(c):
    if ord(c) < 91:
        val = ord(c) - 90 + 52
    else:
        val = ord(c) - 122 + 26
    return val


file = open("input.txt")
sumval = 0
sumbadge = 0
line_number = 0
group_arr = [[],[],[]]
for line in file:
    line.rstrip()
    sack = [line[0:int(len(line)/2)], line[int(len(line)/2):len(line)]]
    group_arr[line_number % 3] = line[0:len(line)-1]
    sumval+=priority((set(sack[0]) & set(sack[1])).pop())
    if (line_number % 3 == 2):
        sumbadge+=priority((set(group_arr[0]) & set(group_arr[1]) & set(group_arr[2])).pop())
    line_number += 1
print(sumval)
print(sumbadge)

alright guys, here's my enterprise grade, production ready, world deployable ts answer. notice how type safe it is.

import * as fs from 'fs'`;

console.log(
  fs.readFileSync(process.argv[2], 'utf-8')
    .split('\n')
    .reduce((pl, l) => {
      let h: any = {};
      let ch = l.split('')
        .reduce((pc,c,i) => i<l.length/2 ? ((h[c]=1)&&0) : (pc||(h[c]?c.charCodeAt(0):0)), 0);
      return pl+ch-(ch<=90?38:96)
    }, 0)
);

PART 2, no declared vars. so let's get crunk

import * as fs from 'fs'`;

console.log(
  fs.readFileSync(process.argv[2], 'utf-8')
    .split('\n')
    .reduce(([pl, h], l, i) => [
      pl + l.split('').reduce((pc,c) => (
        i % 3 === 0 ? ((h[c]=1) &&0) : 
        i % 3 === 1 ? ((h[c]&&=2) &&0) :
        pc || (h[c]===2&&(c.charCodeAt(0)-(c.charCodeAt(0)<=90?38:96)))
      ) || 0, 0),
      i % 3 === 2 ? {} : h
    ], [0, {} as any])
);

Anyone else doing javascript?

/* Part 1 */
function sackPriority(sack) {
    if (!sack.length) return 0;

    var count = Math.floor(sack.length/2);
    var left = sack.substr(0,count);
    var right = sack.substr(count);

    for (var i=0;i<count;i++) {
        var c = left.charAt(i);
        if (right.indexOf(c) >= 0) {
            return (left.charCodeAt(i) >= 97) 
                ? left.charCodeAt(i) - 96 : left.charCodeAt(i) - 38;
        }
    }
}


var total = sacks.reduce(function(acc,cur) {
    return acc + sackPriority(cur);
},0);


/* Part 2 */
function badgeType(sacks) {
    if (!sacks[0].length) return 0;
    for (var i=0;i<sacks[0].length;i++) {
        var c = sacks[0].charAt(i);
        if (sacks[1].indexOf(c) >= 0
                && sacks[2].indexOf(c) >= 0) {
            return (sacks[0].charCodeAt(i) >= 97) 
                ? sacks[0].charCodeAt(i) - 96 : sacks[0].charCodeAt(i) - 38;            
        }
    }
}


var total = 0;
for (var j=0;j<sacks.length;j+=3) {
    total += badgeType(sacks.slice(j,j+3));
}

trying to learn python

vals=0
with open("03RucksackReorganization.txt","r") as lines:
    for line in lines:
        dropN=line.rstrip("\n")
        first, second=dropN[:len(dropN)//2], dropN[len(dropN)//2:]
        letters=set(first)
        for ch in second:
            if ch in letters:
                vals+=(ord(ch.lower())-ord('a')+1 + (0 if ch.lower() else 26))
                break
print(vals) 

and part two:

vals=0
with open("03RucksackReorganization.txt","r") as lines:
    index=0
    seen=set()
    for line in lines:
        sansN=line.rstrip("\n")
        if(index==0):
            seen=set(sansN)
        else:
            seen=seen.intersection(set(sansN))
        if(index==2):
            ch=seen.pop()
            vals+=(ord(ch.lower())-ord('a')+1 + (0 if ch.islower() else 26))
            seen.clear()
        index=(index+1)%3
print(vals)

Frick me, man...

Shouldn't have used sets

Edit:

Fixed it up a bit

So easy with real languages

https://fsdfsd.net/cyberdick/AdventOfCode2022/src/branch/master/AOC2022/Puzzles/Day3.cs

Commented out code is from part 1. I'm gonna be so fricked if I keep writing code like this when it gets difficult lmao

Part 1:

with open('input.txt') as f:
    lines = f.readlines()
    
items = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
score = 0

for line in lines:
    first, second = line.strip()[:len(line)//2], line[len(line)//2:]
    for char in first:
        if char in second:
            score += items.index(char) 
            break
print(score)

Late submission, but I was recovering from a hangover from a party last night so meh.

with open('day3_input.txt', 'r') as inp:
    foo = inp.read().split('\n')

def check(n):
    for a in n[:len(n)//2]:
        if a in n[len(n)//2:]:
            return a

def convert(c):
    val = ord(c)
    if val < 97:
        return val-38
    return val-96

total = 0
for f in foo:
    total += convert(check(f))
print(total)

def check2(a, b, c):
    for x in a:
        if x in b and x in c:
            return x

total = 0
for g in range(0, len(foo), 3):
    total += convert(check2(foo[g], foo[g+1], foo[g+2]))
print(total)

Euro Times.... Cant compete but do it any way:

with open('input03.txt') as file:
    lines = [line.rstrip() for line in file]

def get_priority(item):
    if item >= 97:
        item -= 96
    else:
        item -= 38
    return item

#a
count = 0
for line in lines:
    half = int(len(line)/2)
    first = line[:half]
    second = line[half:]
    intersection = set(first).intersection(set(second))
    item = ord(intersection.pop()) # looked up. Only one item per intersect
    priority = get_priority(item)
    count += priority
print(count)

#b
index = 0
count = 0
while index < len(lines):
    intersection = set(lines[index]).intersection(set(lines[index+1])).intersection(set(lines[index+2]))
    item = ord(intersection.pop())
    priority = get_priority(item)
    count += priority
    index += 3
print(count)

@AverageMistletoeEnjoyer intersection() gang gang