fork(1) download 
  1. /*
  2. Given an integer n, return the number of prime numbers that are strictly less than n.
  3.  
  4.  
  5.  
  6. Example 1:
  7.  
  8. Input: n = 10
  9. Output: 4
  10. Explanation: There are 4 prime numbers less than 10, they are 2, 3, 5, 7.
  11. Example 2:
  12.  
  13. Input: n = 0
  14. Output: 0
  15. Example 3:
  16.  
  17. Input: n = 1
  18. Output: 0
  19. */
Success #stdin #stdout 0.04s 16792KB
comments (?)
stdin 
Standard input is empty
stdout 
Standard output is empty
https://ideone.com/m6FtWO
language:
JavaScript (SMonkey 60.2.3)
created:
7 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!