Solved ProjectEuler/038,104
This commit is contained in:
19
ProjectEuler/038/desc.yml
Normal file
19
ProjectEuler/038/desc.yml
Normal file
@ -0,0 +1,19 @@
|
||||
title: What is the largest 1 to 9 pandigital that can be formed by multiplying a fixed number by 1, 2, 3, ... ?
|
||||
url: http://projecteuler.net/problem=38
|
||||
|
||||
desc: |
|
||||
Take the number 192 and multiply it by each of 1, 2, and 3:
|
||||
192 x 1 = 192
|
||||
192 x 2 = 384
|
||||
192 x 3 = 576
|
||||
By concatenating each product we get the 1 to 9 pandigital, 192384576. We will call 192384576 the concatenated product of 192 and (1,2,3)
|
||||
The same can be achieved by starting with 9 and multiplying by 1, 2, 3, 4, and 5, giving the pandigital, 918273645, which is the concatenated product of 9 and (1,2,3,4,5).
|
||||
What is the largest 1 to 9 pandigital 9-digit number that can be formed as the concatenated product of an integer with (1,2, ... , n) where n 1?
|
||||
|
||||
solution: |
|
||||
Bruteforce
|
||||
|
||||
solutions:
|
||||
solve.php:
|
||||
desc: Basic solution
|
||||
language: php
|
27
ProjectEuler/038/solve.php
Normal file
27
ProjectEuler/038/solve.php
Normal file
@ -0,0 +1,27 @@
|
||||
<?php
|
||||
function pandigital($number) {
|
||||
$array = count_chars($number,1);
|
||||
ksort($array);
|
||||
if($array == array(49=>1,50=>1,51=>1,52=>1,53=>1,54=>1,55=>1,56=>1,57=>1)) { return true;} else { return false; }
|
||||
}
|
||||
|
||||
while(true) {
|
||||
$value++;
|
||||
|
||||
$test = array(1,2);
|
||||
$key = 2;
|
||||
while(true) {
|
||||
$new = array();
|
||||
foreach($test as $p) {
|
||||
$new[] = $value * $p;
|
||||
}
|
||||
$var = implode('',$new);
|
||||
if(strlen($var) != 9) { break; }
|
||||
if(strlen($var) == 9 AND pandigital($var)) { $good[] = $var; break; }
|
||||
$test[] = $key++;
|
||||
}
|
||||
if($value > 9999) { break; }
|
||||
}
|
||||
|
||||
rsort($good);
|
||||
echo $good[0];
|
Reference in New Issue
Block a user