/
Euler_033.php
64 lines (55 loc) · 1.13 KB
/
Euler_033.php
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
<?php
$nume = [];
$deno = [];
for($a = 10; $a <= 99; $a++){
for($b = $a+1; $b<=99; $b++){
$arr1 = str_split($a);
$arr2 = str_split($b);
if(count(array_intersect($arr1,$arr2))>0)
if($arr1[0] == $arr2[0]){
if($arr2[1] != 0)
if($arr1[1]/$arr2[1] == $a/$b){
array_push($nume, $a);
array_push($deno, $b);
}
}
if($arr1[0] == $arr2[1]){
if($arr2[0] != 0)
if($arr1[1]/$arr2[0] == $a/$b){
array_push($nume, $a);
array_push($deno, $b);
}
}
if($arr1[1] == $arr2[0]){
if($arr2[1] != 0)
if($arr1[0]/$arr2[1] == $a/$b){
array_push($nume, $a);
array_push($deno, $b);
}
}
if($arr1[1] == $arr2[1]){
if($arr2[0] != 0 && $arr2[1] !=0)
if($arr1[0]/$arr2[0] == $a/$b){
array_push($nume, $a);
array_push($deno, $b);
}
}
}
}
$a = 1; $b = 1;
foreach($nume as $x)
$a *= $x;
foreach($deno as $x)
$b *= $x;
echo $a." and ".$b."<br>";
$gcd = gcd($b,$a);
echo $b/$gcd;
function gcd($a, $b){
while($b != 0){
$x = $b;
$b = $a % $b;
$a = $x;
}
return $a;
}
?>