-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path25.php
57 lines (55 loc) · 1 KB
/
25.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
<!--
The Fibonacci sequence is defined by the recurrence relation:
Fn = Fn1 + Fn2, where F1 = 1 and F2 = 1.
Hence the first 12 terms will be:
F1 = 1
F2 = 1
F3 = 2
F4 = 3
F5 = 5
F6 = 8
F7 = 13
F8 = 21
F9 = 34
F10 = 55
F11 = 89
F12 = 144
The 12th term, F12, is the first term to contain three digits.
What is the first term in the Fibonacci sequence to contain 1000 digits?
-->
<?php $startTime = microtime(true);
$a[0] = 1;
$b[0] = 1;
$seqCount = 0;
$numOfDigits = 0;
while ($numOfDigits <= 999) {
$temp = $b;
// $b => $a + $b
$leftover = 0;
for ($i=0; $i < count($a); $i++) {
$b[$i] = $b[$i] + $a[$i]+$leftover;
if ($b[$i]>9) {
$b[$i]-=10;
$leftover = 1;
if (!isset($b[$i+1])) {
$b[$i+1] = 0;
}
}
else
{
$leftover = 0;
}
}
if ($leftover>0) {
$b[count($b)-1] += 1;
}
$a = $temp;
$numOfDigits = count($a);
$seqCount++;
}
$index = $seqCount+1;
$answer = $index;
$endTime = microtime(true);
echo "Answer: ",$answer,"\nTime: ",($endTime - $startTime),"\n";
// Answer: 4782
// Time 1.18s