FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Python-2/project_euler/problem_014/sol2.py at master · https-github-com-nzysoft/Python-2 · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
https-github-com-nzysoft
/
Python-2
Public
forked from
TheAlgorithms/Python
Notifications
You must be signed in to change notification settings
Fork
1
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Python-2
/
project_euler
/
problem_014
/
sol2.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
64 lines (47 loc) · 1.82 KB
Breadcrumbs
Python-2
/
project_euler
/
problem_014
/
sol2.py
Copy path
File metadata and controls
64 lines (47 loc) · 1.82 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
"""
Problem 14: https://projecteuler.net/problem=14
Collatz conjecture: start with any positive integer n. Next term obtained from
the previous term as follows:
If the previous term is even, the next term is one half the previous term.
If the previous term is odd, the next term is 3 times the previous term plus 1.
The conjecture states the sequence will always reach 1 regardless of starting
n.
Problem Statement:
The following iterative sequence is defined for the set of positive integers:
n → n/2 (n is even)
n → 3n + 1 (n is odd)
Using the rule above and starting with 13, we generate the following sequence:
13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1
It can be seen that this sequence (starting at 13 and finishing at 1) contains
10 terms. Although it has not been proved yet (Collatz Problem), it is thought
that all starting numbers finish at 1.
Which starting number, under one million, produces the longest chain?
"""
from
__future__
import
annotations
COLLATZ_SEQUENCE_LENGTHS
=
{
1
:
1
}
def
collatz_sequence_length
(
n
:
int
)
->
int
:
"""Returns the Collatz sequence length for n."""
if
n
in
COLLATZ_SEQUENCE_LENGTHS
:
return
COLLATZ_SEQUENCE_LENGTHS
[
n
]
if
n
%
2
==
0
:
next_n
=
n
//
2
else
:
next_n
=
3
*
n
+
1
sequence_length
=
collatz_sequence_length
(
next_n
)
+
1
COLLATZ_SEQUENCE_LENGTHS
[
n
]
=
sequence_length
return
sequence_length
def
solution
(
n
:
int
=
1000000
)
->
int
:
"""Returns the number under n that generates the longest Collatz sequence.
>>> solution(1000000)
837799
>>> solution(200)
171
>>> solution(5000)
3711
>>> solution(15000)
13255
"""
result
=
max
((
collatz_sequence_length
(
i
),
i
)
for
i
in
range
(
1
,
n
))
return
result
[
1
]
if
__name__
==
"__main__"
:
print
(
solution
(
int
(
input
().
strip
())))
Back
|
FazBrowse Home
|
New Git URL