Sang nguyen to python

#Cach 1: Sang true false
prime = [True] * (n+1)
prime[0] = prime[1] = False
for i in range(2, n+1):
  if prime[i]:
    for j in range(i*i, n+1, i):
      prime[j] = False


#Cach 2: Sang ra so
prime = []
m = []
for i in range(2, n+1):
  if i not in m:
    prime.append(i)
    for j in range(i*i, n+1, i):
      m.append(j)

Similar codes

0 vote209 views1 answer
How to use drf pagination directly
Python
87 votes209 views6 answers
How to convert string to datetime
Python
2 votes242 views1 answer
Run flask application in development mode stack overflow
Python Flask
0 vote209 views1 answer
Python x,y,z is d (20, 30, False)
Python
0 vote202 views1 answer
Python convert dict to xml
Python
1 vote220 views1 answer
How to sort in greatest to least python
Python
0 vote201 views1 answer
Getting range lowest and highest values from np array
Python
0 vote203 views1 answer
Python die
Python
5 votes193 views1 answer
Python generate id
Python
-1 vote257 views2 answers
Design patterns in python
Python