16 lines
299 B
Plaintext
16 lines
299 B
Plaintext
|
import time
|
||
|
|
primes = 0
|
||
|
|
n = int(input())
|
||
|
|
start = time.time()
|
||
|
|
divisors = 0
|
||
|
|
for i in range(2, n):
|
||
|
|
divisors = i-1
|
||
|
|
while i % divisors != 0:
|
||
|
|
divisors = divisors - 1
|
||
|
|
if divisors == 1:
|
||
|
|
primes = primes + 1
|
||
|
|
print(primes, time.time() - start)
|
||
|
|
|
||
|
|
|
||
|
|
#def f():
|
||
|
|
# print(primes, n, start, divisors)
|