58: Count prime numbers

Given a non-negative integer, count the number of prime numbers less than the given number

 

Example 1

Input:   3

Output:  1

Example 2

Input:   10

Output:  4
Difficulty:Easy
Topic:HashSet
Problem #:58