Count the number of primes less than 'n'.
Solution Stats
Problem Comments
-
2 Comments
Jihye Sofia Seo
on 10 Feb 2017
Nice test cases!
David Verrelli
on 7 Jun 2018
With a more robust Test Suite many/most of the submissions would fail for ignoring the Problem Statement instruction that primes must be less than n. Please add test cases in which the input x (or "n") is itself a prime.
Problem Recent Solvers47
Suggested Problems
-
2532 Solvers
-
1917 Solvers
-
Make one big string out of two smaller strings
1070 Solvers
-
Do Fast Fourier Transformation
178 Solvers
-
579 Solvers
More from this Author9
Problem Tags
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)