maths/prime_numbers.py · hawk/Python

代码拉取完成,页面将自动刷新

richgiteeai

Watch

不关注关注所有动态仅关注版本发行动态关注但不提醒动态

1 Star 0 Fork 0

hawk/Python

代码 Issues 0 Pull Requests 0 Wiki 统计流水线

服务

加入 Gitee

与超过 1400万开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)

免费加入

已有帐号? 立即登录

文件

master

分支 (6)

管理

master

PIL.Image.point-takes-an-int

itsvinayak-patch-1

max-complexityto-15

doubly_linked_list.py-Add-doctests

Fix-ftp-to-allow-doctests

克隆/下载

HTTPS SSH SVN SVN+SSH 下载ZIP

提示

下载代码请复制以下命令到终端执行

为确保你提交的代码身份被 Gitee 正确识别,请执行以下命令完成配置

git config --global user.name userName 
git config --global user.email userEmail

初次使用 SSH 协议进行代码克隆、推送等操作时,需按下述提示完成 SSH 配置

1 生成 RSA 密钥

2 获取 RSA 公钥内容,并配置到 SSH公钥中

在 Gitee 上使用 SVN,请访问使用指南

使用 HTTPS 协议时,命令行会出现如下账号密码验证步骤。基于安全考虑,Gitee 建议配置并使用私人令牌替代登录密码进行克隆、推送等操作

Username for 'https://gitee.com': userName

Password for 'https://userName@gitee.com': # 私人令牌

分支 6

标签 0

Python

maths

prime_numbers.py

prime_numbers.py 1.82 KB

import math
from typing import Generator

def slow_primes(max: int) -> Generator[int, None, None]:
 """
 Return a list of all primes numbers up to max.
 >>> list(slow_primes(0))
 []
 >>> list(slow_primes(-1))
 []
 >>> list(slow_primes(-10))
 []
 >>> list(slow_primes(25))
 [2, 3, 5, 7, 11, 13, 17, 19, 23]
 >>> list(slow_primes(11))
 [2, 3, 5, 7, 11]
 >>> list(slow_primes(33))
 [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31]
 >>> list(slow_primes(10000))[-1]
 9973
 """
 numbers: Generator = (i for i in range(1, (max + 1)))
 for i in (n for n in numbers if n > 1):
 for j in range(2, i):
 if (i % j) == 0:
 break
 else:
 yield i

def primes(max: int) -> Generator[int, None, None]:
 """
 Return a list of all primes numbers up to max.
 >>> list(primes(0))
 []
 >>> list(primes(-1))
 []
 >>> list(primes(-10))
 []
 >>> list(primes(25))
 [2, 3, 5, 7, 11, 13, 17, 19, 23]
 >>> list(primes(11))
 [2, 3, 5, 7, 11]
 >>> list(primes(33))
 [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31]
 >>> list(primes(10000))[-1]
 9973
 """
 numbers: Generator = (i for i in range(1, (max + 1)))
 for i in (n for n in numbers if n > 1):
 # only need to check for factors up to sqrt(i)
 bound = int(math.sqrt(i)) + 1
 for j in range(2, bound):
 if (i % j) == 0:
 break
 else:
 yield i

if __name__ == "__main__":
 number = int(input("Calculate primes up to:\n>> ").strip())
 for ret in primes(number):
 print(ret)

# Let's benchmark them side-by-side...
 from timeit import timeit

print(timeit("slow_primes(1_000_000)", setup="from __main__ import slow_primes"))
 print(timeit("primes(1_000_000)", setup="from __main__ import primes"))

一键复制编辑原始数据按行查看历史

Christian Clauss 提交于 2020年07月06日 15:44 +08:00 . isort --profile black . (#2181)

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 65 66 67 68 69 70

import math
from typing import Generator


def slow_primes(max: int) -> Generator[int, None, None]:
 """
 Return a list of all primes numbers up to max.
 >>> list(slow_primes(0))
 []
 >>> list(slow_primes(-1))
 []
 >>> list(slow_primes(-10))
 []
 >>> list(slow_primes(25))
 [2, 3, 5, 7, 11, 13, 17, 19, 23]
 >>> list(slow_primes(11))
 [2, 3, 5, 7, 11]
 >>> list(slow_primes(33))
 [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31]
 >>> list(slow_primes(10000))[-1]
 9973
 """
 numbers: Generator = (i for i in range(1, (max + 1)))
 for i in (n for n in numbers if n > 1):
 for j in range(2, i):
 if (i % j) == 0:
 break
 else:
 yield i


def primes(max: int) -> Generator[int, None, None]:
 """
 Return a list of all primes numbers up to max.
 >>> list(primes(0))
 []
 >>> list(primes(-1))
 []
 >>> list(primes(-10))
 []
 >>> list(primes(25))
 [2, 3, 5, 7, 11, 13, 17, 19, 23]
 >>> list(primes(11))
 [2, 3, 5, 7, 11]
 >>> list(primes(33))
 [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31]
 >>> list(primes(10000))[-1]
 9973
 """
 numbers: Generator = (i for i in range(1, (max + 1)))
 for i in (n for n in numbers if n > 1):
 # only need to check for factors up to sqrt(i)
 bound = int(math.sqrt(i)) + 1
 for j in range(2, bound):
 if (i % j) == 0:
 break
 else:
 yield i


if __name__ == "__main__":
 number = int(input("Calculate primes up to:\n>> ").strip())
 for ret in primes(number):
 print(ret)

 # Let's benchmark them side-by-side...
 from timeit import timeit

 print(timeit("slow_primes(1_000_000)", setup="from __main__ import slow_primes"))
 print(timeit("primes(1_000_000)", setup="from __main__ import primes"))