Cod sursa(job #2499600)
Utilizator | Data | 26 noiembrie 2019 15:04:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | py | Status | done |
Runda | Arhiva educationala | Marime | 0.23 kb |
f = open('ciur.in', 'r')
g = open('ciur.out', 'w')
n = int(f.read())
u = [False] * (n+5)
k = 0
for i in range(2, n+1):
if u[i] == False:
k += 1
for j in range(i+i, n+1, i):
u[j] = True
g.write(str(k))