fork download
copy 
  1. class Solution:
  2.     def countPrimes(self, n: int) -> int:
  3.         primos = [True]*max(2,n)
  4.         resultado = 0
  5.  
  6.         primos[0] = False
  7.         primos[1] = False
  8.         for i in range(2, n):
  9.             for j in range(i*i, n, i):
  10.                 primos[j] = False
  11.  
  12.         for _ in primos:
  13.             if _ == True:
  14.                 resultado += 1
  15.  
  16.         return resultado
  17.  
Success #stdin #stdout 0.08s 14140KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/ECIfBO
language:
Python 3 (python  3.12)
created:
5 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!