@@ -0,0 +1,358 @@
+class Solution(object):%0A    def countPrimes(self, n):%0A        %22%22%22%0A        :type n: int%0A        :rtype: int%0A        %22%22%22%0A        isPrime = %5BTrue%5D * n%0A        ans = 0%0A        for i in xrange(2, n):%0A            if isPrime%5Bi%5D == True:%0A                ans += 1%0A                for j in xrange(2 * i, n, i):%0A                    isPrime%5Bj%5D = False%0A        return ans

add count-primes