https://leetcode.com/problems/count-primes/
class Solution {
public:
int countPrimes(int n) {
if (n < 2)
return 0;
vector<bool> notPrime(n, false);
int count = 0;
for(int i = 2; i < n; i++) {
if(flag[i] == false) {
count++;
for(int j = i + i; j < n; j+=i) {
flag[j] = true;
}
}
}
return count;
}
};