Vignettes

159

25

80

**da07_add_value_to_list_elements:**add value into every element of list**DATASET:**Input DATASETs**day01_fuel:**calculate fuel for mass**day01_fuelrec:**fuel adjustment on fuel itself**day01_part1_solution:**solution for part 1 of day01 puzzle**day01_part2_solution:**solution for part 1 of day01 puzzle**day02:**Day 2 solution**day02_modify_input:**puzzle requires input modification**day02_noun_verb:**find combination of word and noun**day02_part1_solution:**solution of Day 2 part 1**day02_part2_solution:**solution of Day 2 part 1**day03_centralpoint:**Central point - starting position**day03_deltapath:**build delta to the path according**day03_fullpath:**Build path from starting point**day03_intersection:**Find all intersections of 2 pathes**day03_mhtdist:**Manhettan distance**day03_part1:**Fund find closest (manhettan distance) intersection of 2...**day03_part1_solution:**solution of Day 3 part 1**day03_part2:**Find shortest (wire length) intersection of 2 wires defined...**day03_part2_solution:**solution of Day 3 part 2**day03_path_direction:**Translate instruction into directoin vector (x, y)**day03_path_length:**Translate instruction into number of steps**day03_position:**current position**day04_docheck:**Function that generalizes 2 types of checks using binary...**day04_filteradj:**Check whether number has at least to adjacent digits**day04_filteradj2:**Check whether adjacent digits are not part of bigger group**day04_filterasc:**Check whether digits of number all go in asscending order**day04_makesequence:**Generate sequence of numbers based on value of low and high...**day04_part1_solution:**Day 04 part 1 solution**day04_part2_solution:**Day 04 part 2 solution**day05_changebase:**change relative base**day05_decodeop:**Decode operation**day05_diagnostic:**run diagnostics on INTCODE computer**day05_getv:**Get value**day05_instruct_par_mode:**instruction parameter modes**day05_intruct_length:**Length of instruction - how many registers belong to...**day05_intruct_op:**decode instruction to identify operation**day05_jumpiffalse:**move pointer if frist parameter is zero**day05_jumpiftrue:**move pointer if frist parameter is non-zero**day05_oneifequal:**move pointer if frist parameter is equal to second**day05_oneifless:**move pointer if frist parameter is less than second**day05_opinput:**read input**day05_opmul:**multiply two numbers**day05_opoutput:**return result (print output)**day05_opsum:**add two numbers**day05_part1_solution:**Day 05 part 1 solution**day05_part2_solution:**Day 05 part 2 solution**day05_run_computer:**run diagnostics on INTCODE computer**day05_setv:**Set value**day06_build_chains:**build chains of orbits towards center of everything**Browse all...**

solution for part 1 of day01 puzzle

1 |

What can we improve?

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.

Close