Advent of Code 2022: no pato edition

thenanox #91 Dic '22

la verdad es que este tipo de problemas, casi siempre son manejos de strings/arrays y hay lenguajes como javascript y python que te dan una facilidad...

lo que pasa que javascript ya no me apetece, y quiero ver que tal aplica go, pero veo que sin ser verboso no es ubercomodo

vamos a por el day2

#83 va por tiempo desde que salen a las 5AM

nobody1 #92 Dic '22

Día 2 c++

spoiler

#include <iostream>
#include <map>
#include <vector>
#include <set>
#include <string>
#include <bitset>
#include <algorithm>

using namespace std;

map<string, int> points = {{"X", 1}, {"Y", 2} , {"Z", 3}};
map<string, int> positions_x = {{"A", 0}, {"B", 1} , {"C", 2}};
map<string, int> positions_y = {{"X", 0}, {"Y", 1} , {"Z", 2}};

//          rock paper scissors
// rock     3     0      6
// paper    6     3      0
// scissors 0     6      3
int results[3][3] = {{3, 0, 6}, {6, 3, 0}, {0, 6, 3}};

int main()
{
    string x, y;
    int score = 0;   

while (cin >> x >> y){ 
    score += points[y] + results[positions_y[y]][positions_x[x]];
}

cout << score << endl;
}

2

S

Sarwaz #93 Dic '22

No se como puede ser tan popular esta competición si al final es solo parsear el input, comparado con el google code o el facebook hacker cup es horrible.

1 respuesta

Eckooo #94 Dic '22

python day 2

temp = open("input.txt", 'r').read().splitlines()

score_table = {
    'A X': 4,
    'A Y': 8,
    'A Z': 3,
    'B X': 1,
    'B Y': 5,
    'B Z': 9,
    'C X': 7,
    'C Y': 2,
    'C Z': 6
}

score_table2 = {
    'A X': 3,
    'A Y': 4,
    'A Z': 8,
    'B X': 1,
    'B Y': 5,
    'B Z': 9,
    'C X': 2,
    'C Y': 6,
    'C Z': 7
}

intlist1 = []
intlist2 = []

for x in temp:
    intlist1.append(score_table[x])
    intlist2.append(score_table2[x])

total_score1 = sum(intlist1)
total_score2 = sum(intlist2)

1 1 respuesta

sergioRG #95 Dic '22 Juntabrackets

#93 Imagino que intenta abarcar un público más amplio y hacer que la gente se adhiera

gonya707 #96 Dic '22 Moderador

#94 Joder viendo tu solucion me siento gilipollas xD yo he hecho split a las lineas y analizado todas las combinaciones posibles con ifs anidados. Ha funcionado a la primera pero si hubiese jodido un numero la lio

1 respuesta

Colgajo #97 Dic '22

NodeJS Día 2

spoiler

const fs = require('fs').promises;

const moves = {
  A: {
    value: 1,
    beats: 'C',
    loses: 'B',
  },
  B: {
    value: 2,
    beats: 'A',
    loses: 'C',
  },
  C: {
    value: 3,
    beats: 'B',
    loses: 'A',
  },
};

const getMatchPoints = (opponentMove, strategy) => {
  const { value, beats, loses } = moves[opponentMove];
  if (strategy === 'X') {
    return moves[beats].value;    

  }
  if (strategy === 'Y') {
    return 3 + value;
  }
  return 6 + moves[loses].value;
};

const main = async () => {
  const input = await fs.readFile('./input.txt', 'utf8');
  const result = input.split('\n').reduce((acc, line) => {
    const [opponentMove, strategy] = line.split(' ');
    return acc + getMatchPoints(opponentMove, strategy);
  }, 0);
  console.log(result);
  process.exit();
};

main();

Eckooo #98 Dic '22

#96 nah la mia es muy cerda y nada optima si hubiera mas combinaciones posibles

wolfie6949 #99 Dic '22

Día 2 Node,

No me gusta mucho cómo ha quedado, pero no tengo mucho mas tiempo que dedicarle:

spoiler

const fs = require("fs");

const input = fs
  .readFileSync("input.txt")
  .toString()
  .split("\n")
  .filter((x) => x !== "")
  .map((x) => x.split(" "));

const SCORES = { X: 1, Y: 2, Z: 3 };
const CHOICES_TO_DRAW = { A: "X", B: "Y", C: "Z" };
const CHOICES_TO_WIN = { A: "Y", B: "Z", C: "X" };
const CHOICES_TO_LOSE = { A: "Z", B: "X", C: "Y" };

const getResult = (player1, player2) => {
  if (CHOICES_TO_DRAW[player1] === player2) return SCORES[player2] + 3;
  if (CHOICES_TO_WIN[player1] === player2) return SCORES[player2] + 6;
  if (CHOICES_TO_LOSE[player1] === player2) return SCORES[player2];
};

let score = 0;
input.forEach((line) => {
  score += getResult(line[0], line[1]);
});
console.log(score);

// Part 2

let newStrategy = input.map((x) => {
  if (x[1] === "X") return [x[0], CHOICES_TO_LOSE[x[0]]];
  if (x[1] === "Y") return [x[0], CHOICES_TO_DRAW[x[0]]];
  if (x[1] === "Z") return [x[0], CHOICES_TO_WIN[x[0]]];
});

score = 0;
newStrategy.forEach((line) => {
  score += getResult(line[0], line[1]);
});
console.log(score);

JonaN #100 Dic '22 Juntabrackets

Intentando juntar todos los brackets posibles.

Día 2 python

results1={'AX':4,'AY':8,'AZ':3,'BX':1,'BY':5,'BZ':9,'CX':7,'CY':2,'CZ':6}
results2={'AX':3,'AY':4,'AZ':8,'BX':1,'BY':5,'BZ':9,'CX':2,'CY':6,'CZ':7}
[sum(x) for x in zip(*[(results1[l],results2[l]) for l in [l.strip().replace(" ","") for l in open('./Input02.txt').readlines()]])]

Cecos94 #101 Dic '22

Scala day 2

spoiler

override def part1(inputs: Seq[String]): Int = {
var points = 0
val mapPoints = Map("X" -> 1, "Y" -> 2, "Z" -> 3)
val winCombinations = Seq("A Y","B Z", "C X")
val tieCombinations = Seq("A X","B Y", "C Z")

inputs.foreach(a => {
  points += mapPoints(a.takeRight(1))

  if(winCombinations.contains(a)) points += 6
  else if(tieCombinations.contains(a)) points += 3
})
points

}

override def part2(inputs: Seq[String]): Int = {
var points = 0
val winCombinations = Map("A"-> 2,"B" ->3, "C" -> 1)
val tieCombinations = Map("A"-> 1,"B" ->2, "C" -> 3)
val loseCombinations = Map("A"-> 3,"B" ->1, "C" -> 2)

inputs.foreach(a => {
  if(a.takeRight(1).equals("Y")) points = points + 3 + tieCombinations(a.head.toString)
  else if(a.takeRight(1).equals("X")) points = points + loseCombinations(a.head.toString)
  else points = points + 6 + winCombinations(a.head.toString)
})
points

}

spoiler

R

RsTTa #102 Dic '22

Dejo por aqui los dos primeros dias en Scala.

Dia 1

spoiler

Parte 1

import scala.io.Source


object Main extends App {
    val fp = Source.fromFile("in")
    val ans = fp
                .getLines
                .mkString(",")
                .split(",,")
                .map(elfInventory => elfInventory.split(",").map(n => n.toInt))
                .map(formattedInventory => formattedInventory.sum)
                .max
    println(ans)
    fp.close
}

Parte 2

object Main extends App {
    val fp = Source.fromFile("in")
    val ans = fp
                .getLines
                .mkString(",")
                .split(",,")
                .map(elfInventory => elfInventory.split(",").map(n => n.toInt))
                .map(formattedInventory => formattedInventory.sum)
                .sortWith(_ > _)
                .slice(0, 3)
                .sum
    println(ans)
    fp.close
}

Dia 2 (cero mapas xD)

spoiler

import scala.io.Source

object Main extends App{
    val fp = Source.fromFile("in")
    var score1 = 0
    var score2 = 0
    fp.getLines.foreach(line => {
        val Array(p1, x) = (
            line.split(" ").map(s => s.charAt(0).toInt),
            Array('A'.toInt - 1, 'X'.toInt - 1)
        )
        .zipped
        .map(_ - _)
        .toArray
        val mod = Math.floorMod(x - p1, 3)
        score1 += x + (if (mod == 1) 6 else if (mod == 0) 3 else 0)
        score2 += ((x - 1) * 3) + ((p1 + x) % 3) + 1
    })
    println(score1)
    println(score2)
    fp.close
}

PiradoIV #103 Dic '22 Brongster

Día 2, le he puesto estadísticas por las risas

Video

1

josej123 #104 Dic '22 Penitente

Dia 2 en c# muy poco pensado comparado con los códigos de otros foreros en otros lenguajes:

spoiler

public class Day2
	{
        bool isP1 = true;

    public Day2()
	{
        executeCode();
        isP1 = false;
        executeCode();
    }

    void executeCode()
    {
        string? line;
        int totalPoints = 0;
        try
        {
            StreamReader sr = new StreamReader(INPUT_PATH);
            line = sr.ReadLine();
            while (line != null)
            {
                string unwrappedLine = line ?? "";
                string[] values = unwrappedLine.Split(" ");
                if (values.Length == 2)
                {
                    totalPoints += checkRoundPoints(values[1], values[0]) + obtainPointValue(values[1], values[0]);
                }
                line = sr.ReadLine();
            }
            sr.Close();
        }
        catch (Exception e)
        {
            Console.WriteLine($"Exception: {e}");
        }
        string part = isP1 ? "first" : "second";
        Console.WriteLine($"Points obtained for {part} part: {totalPoints}");
    }

    int checkRoundPoints(string myPlay, string enemyPlay)
    {
         return isP1 ? RoundP1(myPlay, enemyPlay) : RoundP2(myPlay);
    }

    int obtainPointValue(string myPlay, string enemyPlay) {
        return isP1 ? obtainPointP1(myPlay) : obtainPointP2(myPlay, enemyPlay);
    }

    int obtainPointP1(string value)
    {
        switch (value)
        {
            case "X": return 1;
            case "Y": return 2;
            case "Z": return 3;
            default: return 0;
        }
    }

    int obtainPointP2(string myPlay, string enemyPlay) {
        switch (myPlay)
        {
            case "X":
                if (enemyPlay == "A") { return 3; }
                else if (enemyPlay == "B") {  return 1; }
                else { return 2; }
            case "Y":
                if (enemyPlay == "A") { return 1; }
                else if (enemyPlay == "B") {  return 2; }
                else { return 3; }
            case "Z":
                if (enemyPlay == "A") { return 2;}
                else if (enemyPlay == "B") { return 3; }
                else { return 1; }
            default: return 0;
        }
    }
    int RoundP1(string myPlay, string enemyPlay) {
        if ((myPlay == "X" && enemyPlay == "A")
            || (myPlay == "Y" && enemyPlay == "B")
            || (myPlay == "Z" && enemyPlay == "C"))
        {
            return 3;
        }
        else if ((enemyPlay == "C" && myPlay == "X")
            || (enemyPlay == "A" && myPlay == "Y")
            || (enemyPlay == "B" && myPlay == "Z"))
        {
            return 6;
        }
        else
        {
            return 0;
        }
    }

    int RoundP2(string value) {
        switch (value) {
            case "X" : default: return 0;
            case "Y": return 3;
            case "Z": return 6;
        }
    }
}

Pizzelio #105 Dic '22

Lo estoy haciendo en java, me ha quedado una guarrada de código indigna pero no he visto cómo hacerlo más bonito.

spoiler

He querido usar ascii para sacar una regla según la diferencia entre su letra y la mía y bueno, ha quedado asqueroso. En la segunda parte he tenido que meter un map (al final dos por dejarlo más claro)

    public static int solve(List<String> input) {
        int score = 0;
        for(String line: input) {
            char oppInput = line.split(" ")[0].charAt(0);
            char myInput = line.split(" ")[1].charAt(0);
            int result = oppInput - (myInput - 23);
            if (result == 0) {
                score += (3 + (myInput - 87));
            } else if (result == -1 || result == 2) {
                score += (6 + (myInput - 87));
            } else {
                score += (myInput - 87);
            }
        }
        return score;
    }

PiradoIV #106 Dic '22 Brongster

No os comáis mucho la cabeza en cómo queda el código, se puede refactorizar luego en cuanto veas que funciona. Muchas veces, la segunda parte de los puzzles suelen cargarse la primera.

Hipnos #107 Dic '22 Dungeon Master

Estoy aprendiendo python

Día 1a

spoiler

input=(open("input.txt", mode="r"))
lineas=input.readlines()
total_lines = len(lineas)

total=0
i=0
lista=[]
max=0

while i < total_lines:

if lineas[i] != '\n':
    total=total+int(lineas[i])
else:
    lista.append(total)
    if max < total:
        max = total

    total=0

i=i+1

input.close()
print(lista)
print (max)

Día 1b

spoiler

input=(open("input.txt", mode="r"))
lineas=input.readlines()
total_lines = len(lineas)

total=0
i=0
lista=[]
max=0
max2=0
Max3=0

while i < total_lines:

if lineas[i] != '\n':
    total=total+int(lineas[i])
else:
    lista.append(total)
    if max < total:
        max3 = max2
        max2 = max
        max = total
    else:
        if max2 < total:
            max3 = max2
            max2 = total
        else:
            if max3 < total:
                max3 = total
    total=0

i=i+1

input.close()
print(lista)
print (max+max2+max3)

Día 2a

spoiler

input=(open("input.txt", mode="r"))
lineas=input.readlines()
total_lines = len(lineas)

i=0
scoretotal=0

while i < total_lines:
    match lineas[i]:
        case('A X\n'):
            score_a = 1
            score_b = 3
        case('A Y\n'):
            score_a = 2
            score_b = 6
        case('A Z\n'):
            score_a = 3
            score_b = 0
        case('B X\n'):
            score_a = 1
            score_b = 0
        case('B Y\n'):
            score_a = 2
            score_b = 3
        case('B Z\n'):
            score_a = 3
            score_b = 6
        case('C X\n'):
            score_a = 1
            score_b = 6
        case('C Y\n'):
            score_a = 2
            score_b = 0
        case('C Z\n'):
            score_a = 3
            score_b = 3

scoretotal = scoretotal + score_a + score_b
i=i+1

input.close()
print (scoretotal)

Día 2b

spoiler

input=(open("input.txt", mode="r"))
lineas=input.readlines()
total_lines = len(lineas)

i=0
scoretotal=0

while i < total_lines:
    match lineas[i]:
        case('A X\n'):
            score_a = 3
            score_b = 0
        case('A Y\n'):
            score_a = 1
            score_b = 3
        case('A Z\n'):
            score_a = 2
            score_b = 6
        case('B X\n'):
            score_a = 1
            score_b = 0
        case('B Y\n'):
            score_a = 2
            score_b = 3
        case('B Z\n'):
            score_a = 3
            score_b = 6
        case('C X\n'):
            score_a = 2
            score_b = 0
        case('C Y\n'):
            score_a = 3
            score_b = 3
        case('C Z\n'):
            score_a = 1
            score_b = 6

scoretotal = scoretotal + score_a + score_b
i=i+1

input.close()
print (scoretotal)

Krules #108 Dic '22

python dia 1, full pocho

spoiler

totals = []
total = 0

with open('1.txt') as my_file:

for line in my_file:
    if line == '\n':
        totals.append(total)
        total = 0
    else:
        total += int(line.strip())

print(max(totals))
print(sum(sorted(totals, reverse=True)[:3]))

Naith #109 Dic '22 Penitente

Casi se me olvida aun estamos a dia 2 xdd

Day 2 Cpp

std::map<char,  int> values = {
    {'A',1}, {'B',2}, {'C',3},
    {'X',1}, {'Y',2}, {'Z',3}
};

void part1(std::ifstream& input){
    int score = 0;
    std::string game;

    while(std::getline(input, game)){
       auto myVal  = values[game[2]];
       auto elfVal = values[game[0]];
       auto tmp = myVal - elfVal;

       if (tmp == 1 || tmp == -2) // Win
           score += myVal + 6;
       else if (tmp == 0) // Draw
           score += myVal + 3;
       else  //Lose
           score += myVal;
    }

    std::cout << "Score A: " << score << std::endl;
}

void part2(std::ifstream& input){
    int score = 0;
    std::string game;

    while(std::getline(input, game)){
        auto elfVal = values[game[0]];
        auto action = values[game[2]];

        if (action == 1) { // Lose
            auto myVal = (elfVal == 1) ? 3 : elfVal - 1;
            score += myVal;
        } else if (action == 2) { // Draw
            score += elfVal + 3;
        } else if (action == 3) { // Win
            auto myVal = (elfVal == 3) ? 1 : elfVal + 1;
            score += myVal + 6;
        }
    }

    std::cout << "Score B: " << score << std::endl;
}

Soumynon #110 Dic '22

Día 1. NodeJS. Parte 1 y 2

const fs = require("fs");
const path = require("path");

let currentElf = 0;

const result = (top) => {
  const isTop = (tops, number) => tops.findIndex((top) => top < number);

  return fs
    .readFileSync(path.resolve(__dirname, "input.txt"), "utf8")
    .split("\n")
    .reduce((acc, current) => {
      const currentNumber = Number(current);
      if (currentNumber) {
        if (acc[currentElf]) {
          acc[currentElf] += currentNumber;
        } else {
          acc[currentElf] = currentNumber;
        }
      } else {
        currentElf++;
      }
      return acc;
    }, [])
    .reduce((tops, current) => {
      const topIndex = isTop(tops, current);
      if (topIndex !== -1) {
        tops[topIndex] = current;
      }
      return tops;
    }, Array(top).fill(0))
    .reduce((total, current) => total + current, 0);
};

console.log(result(1), result(3));

Foxtreme #111 Dic '22 Inocente

Tremendo bruteforce el dia 2. Se podría hacer súper elegante, pero que pereza...

Subido a github

Soumynon #112 Dic '22

Día 2. NodeJS. Parte 1 y 2

const fs = require("fs");
const path = require("path");

const outcome = {
  WIN: 6,
  DRAW: 3,
  LOSE: 0,
};

const GAME = {
  figures: {
    X: 1, // Rock
    Y: 2, // Paper
    Z: 3, // Scissors
  },
  result: {
    A: {
      // Rock
      Y: outcome.WIN,
      X: outcome.DRAW,
      Z: outcome.LOSE,
    },
    B: {
      // Paper
      Z: outcome.WIN,
      Y: outcome.DRAW,
      X: outcome.LOSE,
    },
    C: {
      // Scissors
      X: outcome.WIN,
      Z: outcome.DRAW,
      Y: outcome.LOSE,
    },
  },
  play: {
    A: {
      Z: "Y",
      Y: "X",
      X: "Z",
    },
    B: {
      Z: "Z",
      Y: "Y",
      X: "X",
    },
    C: {
      Z: "X",
      Y: "Z",
      X: "Y",
    },
  },
};

const getPoints = (opp, myPlay) =>
  GAME.figures[myPlay] + GAME.result[opp][myPlay];

const getResult = (exercise) =>
  fs
    .readFileSync(path.resolve(__dirname, "input.txt"), "utf8")
    .split("\n")
    .reduce((acc, current) => {
      const play = current.split(" ");
      const myPlay = exercise === 1 ? play[1] : GAME.play[play[0]][play[1]];
      return acc + getPoints(play[0], myPlay);
    }, 0);

console.log(getResult(1), getResult(2));

Edurolp #113 Dic '22

Día 3. Pyhton. Oneliner. Parte 1 y 2

Parte 1

print(sum([ord(list(set(x.strip()[:len(x.strip())//2])&set(x.strip()[len(x.strip())//2:]))[0]) - (96 if list(set(x.strip()[:len(x.strip())//2])&set(x.strip()[len(x.strip())//2:]))[0].islower() else 38) for x in open('input.txt')]))

Resumen del código: Por cada línea, parto por la mitad la cadena, convierto cada mitad a un set y les hago un & lógico que te da las letras que se repiten. Con el resultado, utilizo ord() para sacar su valor numérico en ASCII y, dependiendo de si es mayúscula o minúscula, le resto una cantidad distinta para que me de el valor de prioridad correcto que tiene. De esta manera acabo con una lista con los valores de prioridad de cada línea, por lo que con hacer un sum() de la lista ya tienes el resultado correcto

Parte 2

print(sum([ord(list(set(x[0])&set(x[1])&set(x[2]))[0]) - (96 if list(set(x[0])&set(x[1])&set(x[2]))[0].islower() else 38) for x in zip(*(iter([x.strip() for x in open('input.txt')]),)*3)]))

Resumen del código: Aquí parecido, solo que voy formando grupos de 3 con cada línea (ejemplo, [('linea 1','linea 2','linea 3'),('linea 4','linea 5','linea 6')] ) y aplicando la misma lógica que antes, hago set('linea 1') & set('linea 2') & set('linea 3') para sacar la letra que se repite. Teniendo la letra que se repite puedo hacer como antes y sacar el orden de prioridad y sumar la lista resultante

nobody1 #114 Dic '22

Día 3 C++

spoiler

int main()
{
string input, a, b;
int score = 0;

while (cin >> input){ 
    int size = input.size();
    a = input.substr(0, size/2);
    b = input.substr(size/2);
    for (char& c:a){
        if (b.find(c) != string::npos){
            if (islower(c))
                score+= c - 96;
            else
                score+= c - 38;
            break;
        }
    }
}
cout << score << endl;

}

spoiler

sergioRG #115 Dic '22 Juntabrackets

Dia 3

spoiler

import sys
from functools import reduce


def _prio(x):
  if ord('A') <= ord(x) <= ord('Z'):
    return ord(x) - ord('A') + 27
  return ord(x) - ord('a') + 1


ans, buffer = [0, 0], []

for i, (n, line) in enumerate(map(lambda x: (len(x.strip()), [_prio(y) for y in x.strip()]), sys.stdin)):
  ans[0] += list(set(line[n // 2:]) & set(line[:n // 2]))[0]
  buffer.append(set(line))
  if len(buffer) == 3:
    ans[1] += list(reduce(set.__and__, buffer))[0]
    buffer = []

print(ans)

gonya707 #116 Dic '22 Moderador

Dia 3 hecho desde el móvil. Saludos a los sufridores como yo

2

JonaN #117 Dic '22 Juntabrackets

Día 3, python

import string
letters = list(string.ascii_lowercase)+list(string.ascii_uppercase)
conversion = {letters[i]: range(1,53)[i] for i in range(len(letters))}

print(sum([conversion[''.join(set(i[:int(len(i)/2)]).intersection(i[int(len(i)/2):]))] for i in [l.strip() for l in open('./Input03.txt').readlines()]]))

print(sum([conversion[''.join(set(i[0]) & set(i[1]) & set(i[2]))] for i in [[l.strip() for l in open('./Input03.txt').readlines()][x:x+3] for x in range(0,len([l.strip() for l in open('./Input03.txt').readlines()]),3)]]))

eZpit #118 Dic '22 Juntabrackets

Day 3 listo.

Hoy el top 1 y top 2 de la parte 1 son AIs, en 10s y 30s
https://www.reddit.com/r/adventofcode/comments/zb8tdv/2022_day_3_part_1_openai_solved_part_1_in_10/?utm_source=share&utm_medium=ios_app&utm_name=iossmf

wolfie6949 #119 Dic '22

Pues listo el día 3 en Node:
Parte 1:

spoiler

const fs = require("fs");

function getCommonItemType(s) {
  const firstHalf = s.substring(0, s.length / 2);
  const secondHalf = s.substring(s.length / 2);

  for (const ch of firstHalf) {
    if (secondHalf.includes(ch)) {
      return ch;
    }
  }
}

function isLowercase(s) {
  return s === s.toLowerCase();
}

const rucksacks = fs
  .readFileSync("input.txt", "utf8")
  .split("\n")
  .filter((x) => x !== "");

let sumOfPriorities = 0;

for (const rucksack of rucksacks) {
  const commonItemType = getCommonItemType(rucksack);
  sumOfPriorities += isLowercase(commonItemType)
    ? commonItemType.charCodeAt(0) - 96
    : commonItemType.charCodeAt(0) - 38;
}

console.log(sumOfPriorities);

Parte 2

spoiler

const fs = require("fs");
const fs = require("fs");

function getCommonItemType(s1, s2, s3) {
  for (const ch of s1) {
    if (s2.includes(ch) && s3.includes(ch)) {
      return ch;
    }
  }
}

function isLowercase(s) {
  return s === s.toLowerCase();
}

const rucksacks = fs
  .readFileSync("input.txt", "utf8")
  .split("\n")
  .filter((x) => x !== "");

let sumOfPriorities = 0;

for (let i = 0; i < rucksacks.length; i += 3) {
  const commonItemType = getCommonItemType(
    rucksacks[i],
    rucksacks[i + 1],
    rucksacks[i + 2]
  );

  sumOfPriorities += isLowercase(commonItemType)
    ? commonItemType.charCodeAt(0) - 96
    : commonItemType.charCodeAt(0) - 38;
}

console.log(sumOfPriorities);

Hipnos #120 Dic '22 Dungeon Master

Sigo aprendiendo python.

Día 3 a:

spoiler

Día 3b:

spoiler

Usuarios habituales

Tags