algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-04 16:57:32 +08:00
Code Issues Packages Projects Releases Wiki Activity

Euler 070 partial replacement of numpy loops. (#9055)

Browse Source 
* Euler 070 partial replacement of numpy loops.

* Update project_euler/problem_070/sol1.py

* project_euler.yml: Upgrade actions/checkout@v4 and add numpy

* Update project_euler.yml

---------

Co-authored-by: Christian Clauss <cclauss@me.com>
This commit is contained in:
Kamil
2023-09-11 15:11:22 +05:00
committed by GitHub
parent 5a5ca06944
commit 97e2de0763
2 changed files with 10 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
project_euler/problem_070/sol1.py
View File

@ -30,6 +30,8 @@ https://en.wikipedia.org/wiki/Euler's_totient_function#Euler's_product_formula
"""
from __future__ import annotations
import numpy as np
def get_totients(max_one: int) -> list[int]:
"""
@ -42,17 +44,14 @@ def get_totients(max_one: int) -> list[int]:
>>> get_totients(10)
[0, 1, 1, 2, 2, 4, 2, 6, 4, 6]
"""
totients = [0] * max_one
for i in range(max_one):
totients[i] = i
totients = np.arange(max_one)
for i in range(2, max_one):
if totients[i] == i:
for j in range(i, max_one, i):
totients[j] -= totients[j] // i
x = np.arange(i, max_one, i) # array of indexes to select
totients[x] -= totients[x] // i
return totients
return totients.tolist()
def has_same_digits(num1: int, num2: int) -> bool: