Part 1 was rather easy - just generate an array of numbers. Part 2 took a while to figure out why test cases pass, but my input gave me "out of memory" error. Very sneaky :)
<?php $input = 236021; function calcNextPos($pos, $steps, $arrLen) { $newPos = $pos + $steps + 1; while($newPos >= $arrLen) { $newPos = $newPos % ($arrLen); } return $newPos; } function findNextTen($input) { $recipes = [3, 7]; $elf1Pos = 0; $elf2Pos = 1; while(count($recipes) < $input + 10) { $elf1Recipe = $recipes[$elf1Pos]; $elf2Recipe = $recipes[$elf2Pos]; $newRecipe = $elf1Recipe + $elf2Recipe; if ($newRecipe > 9) { $recipes[] = 1; } $recipes[] = $newRecipe % 10; $elf1Pos = calcNextPos($elf1Pos, $elf1Recipe, count($recipes)); $elf2Pos = calcNextPos($elf2Pos, $elf2Recipe, count($recipes)); } return join(array_slice($recipes, $input, 10)); } function countRecipesOnLeft($input) { $recipes = [3, 7]; $elf1Pos = 0; $elf2Pos = 1; $str = join($recipes); while(true) { $elf1Recipe = $recipes[$elf1Pos]; $elf2Recipe = $recipes[$elf2Pos]; $newRecipe = $elf1Recipe + $elf2Recipe; if ($newRecipe > 9) { $recipes[] = 1; $str = $str . 1; strlen($str) > strlen($input) && $str = substr($str, strlen($str) - strlen($input)); if ($str == $input) { return count($recipes) - strlen($input); } } $recipes[] = $newRecipe % 10; $str = $str . ($newRecipe % 10); strlen($str) > strlen($input) && $str = substr($str, strlen($str) - strlen($input)); if ($str == $input) { return count($recipes) - strlen($input); } $elf1Pos = calcNextPos($elf1Pos, $elf1Recipe, count($recipes)); $elf2Pos = calcNextPos($elf2Pos, $elf2Recipe, count($recipes)); } } echo findNextTen($input) . "\n"; echo countRecipesOnLeft($input) . "\n"; ?>
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Part 1 was rather easy - just generate an array of numbers.
Part 2 took a while to figure out why test cases pass, but my input gave me "out of memory" error. Very sneaky :)