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

Simplify code by dropping support for legacy Python (#1143)

Browse Source 
* Simplify code by dropping support for legacy Python

* sort() --> sorted()
This commit is contained in:
Christian Clauss
2019-08-19 15:37:49 +02:00
committed by GitHub
parent 32aa7ff081
commit 47a9ea2b0b
145 changed files with 367 additions and 976 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
project_euler/problem_07/sol1.py
View File

@ -6,14 +6,8 @@ By listing the first six prime numbers:
We can see that the 6th prime is 13. What is the Nth prime number?
"""
from __future__ import print_function
from math import sqrt
try:
raw_input # Python 2
except NameError:
raw_input = input # Python 3
def isprime(n):
if n == 2:
@ -30,7 +24,7 @@ def isprime(n):
def solution(n):
"""Returns the n-th prime number.
>>> solution(6)
13
>>> solution(1)
@ -58,4 +52,4 @@ def solution(n):
if __name__ == "__main__":
print(solution(int(raw_input().strip())))
print(solution(int(input().strip())))

12
project_euler/problem_07/sol2.py
View File

@ -6,14 +6,6 @@ By listing the first six prime numbers:
We can see that the 6th prime is 13. What is the Nth prime number?
"""
from __future__ import print_function
try:
raw_input # Python 2
except NameError:
raw_input = input # Python 3
def isprime(number):
for i in range(2, int(number ** 0.5) + 1):
if number % i == 0:
@ -23,7 +15,7 @@ def isprime(number):
def solution(n):
"""Returns the n-th prime number.
>>> solution(6)
13
>>> solution(1)
@ -73,4 +65,4 @@ def solution(n):
if __name__ == "__main__":
print(solution(int(raw_input().strip())))
print(solution(int(input().strip())))

10
project_euler/problem_07/sol3.py
View File

@ -6,15 +6,9 @@ By listing the first six prime numbers:
We can see that the 6th prime is 13. What is the Nth prime number?
"""
from __future__ import print_function
import math
import itertools
try:
raw_input # Python 2
except NameError:
raw_input = input # Python 3
def primeCheck(number):
if number % 2 == 0 and number > 2:
@ -32,7 +26,7 @@ def prime_generator():
def solution(n):
"""Returns the n-th prime number.
>>> solution(6)
13
>>> solution(1)
@ -50,4 +44,4 @@ def solution(n):
if __name__ == "__main__":
print(solution(int(raw_input().strip())))
print(solution(int(input().strip())))