@ 2014-07-02T07:04:07Z <?php
/**
* A code sample which converts odd integers to word strings and returns the sum of the common factors of even numbers.
*
* The input is assumed to be a random list of integers. For the sum of the common factors of even numbers
* only positive values are taken into consideration
*/
error_reporting(E_ALL);
function exception_handler($exception) {
echo get_class($exception). ' : ' . $exception->getMessage(), "\n";
}
set_exception_handler('exception_handler');
//start
$iB = new IntelligentBee(array(6,12,48, 7, 101, 67));
//$iB->processOddNumbers();
$sum = $iB->processEvenNumbers();
echo PHP_EOL.'Sum of common factors: ' . $sum . PHP_EOL;
//end
class IntelligentBee{
const OneHundred = 100;
const OneThousand = 1000;
const OneMillion = 1000000;
const OneBillion = 1000000000;
protected $minCommonFactors = [];
protected $oddNumbers = [];
protected $evenNumbers = [];
protected $startInt;
protected $endInt;
public function __construct(array $arrayOfIntegers){
$this->evenNumbers = range(16, self::OneMillion, 2);
}
public function processEvenNumbers()
{
$commonFactors = $this->calcFactors($this->getClosestEvenToZero($this->startInt, $this->endInt, $this->evenNumbers));
foreach($this->evenNumbers as $evenNumber){
$commonFactors = $this->checkIfHasCommonFactors($evenNumber, $commonFactors);
}
return array_sum($commonFactors);
}
protected function getClosestEvenToZero($startInt, $endInt, $evenNumbers){
$dist = abs($evenNumbers[0]);
$idx = 0;
$totalNo = count($evenNumbers);
for($i=0;$i<$totalNo;$i++){
$newDist = abs($evenNumbers[$i]);
if($newDist < $dist){
$idx = $i;
$dist = $newDist;
}
if($dist == 0){//only if evenNumbers is sorted
return $evenNumbers[$idx];
}
}
return $evenNumbers[$idx];
}
protected function checkIfHasCommonFactors($int, array $minCommonFactors){
$int = abs($int);
$cF = $this->calcFactors($int);
return array_intersect($cF, $minCommonFactors);
}
private function calcFactors($int)
{
$int = abs($int);
$cF = [];
$max = $int/2;
for($i=1;$i<=$max;$i++){
if(0 === $int%$i){
$cF[] = $i;
}
}
$cF[] = $int;
return $cF;
}
}
Enable javascript to submit You have javascript disabled. You will not be able to edit any code.
Output for 7.0.0 - 7.0.20 , 7.1.0 - 7.1.20 , 7.2.0 - 7.2.33 , 7.3.12 - 7.3.33 , 7.4.0 - 7.4.33 , 8.0.0 - 8.0.30 , 8.1.0 - 8.1.27 , 8.2.0 - 8.2.17 , 8.3.0 - 8.3.4 Process exited with code 137 . Output for 5.4.0 - 5.4.45 , 5.5.24 - 5.5.35 , 5.6.8 - 5.6.28 Fatal error: Allowed memory size of 67108864 bytes exhausted (tried to allocate 32 bytes) in /in/TQQQS on line 43
Process exited with code 255 . Output for 5.1.0 - 5.1.6 , 5.2.0 - 5.2.17 , 5.3.0 - 5.3.29 Parse error: syntax error, unexpected '[' in /in/TQQQS on line 33
Process exited with code 255 . Output for 5.0.0 - 5.0.5 Parse error: parse error, unexpected '[' in /in/TQQQS on line 33
Process exited with code 255 . Output for 4.4.2 - 4.4.9 Parse error: syntax error, unexpected T_CONST, expecting T_OLD_FUNCTION or T_FUNCTION or T_VAR or '}' in /in/TQQQS on line 29
Process exited with code 255 . Output for 4.3.0 - 4.3.1 , 4.3.5 - 4.3.11 , 4.4.0 - 4.4.1 Parse error: parse error, unexpected T_CONST, expecting T_OLD_FUNCTION or T_FUNCTION or T_VAR or '}' in /in/TQQQS on line 29
Process exited with code 255 . Output for 4.3.2 - 4.3.4 Parse error: parse error, expecting `T_OLD_FUNCTION' or `T_FUNCTION' or `T_VAR' or `'}'' in /in/TQQQS on line 29
Process exited with code 255 . preferences:dark mode live preview
210.37 ms | 401 KiB | 310 Q