Problem:
Score: 200 points

Problem Statement

The number 105 is quite special - it is odd but still it has eight divisors.
Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)?

Constraints

N is an integer between 1 and 200 (inclusive).

Input

Input is given from Standard Input in the following format:

N

Output

Print the count.

Sample Input 1

105

Sample Output 1

1

Among the numbers between 1 and 105, the only number that is odd and has exactly eight divisors is 105.

Sample Input 2

7

Sample Output 2

0

1 has one divisor. 3, 5 and 7 are all prime and have two divisors. Thus, there is no number that satisfies the condition.

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h>

#define rep(i, n) for(int i=0; i < n; i++)
#define reps(i, n) for(int i=1; i <= n; i++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()

using namespace std;
using ll=long long;


int main() {
  int N;
  int ans=0;
  cin >> N;
  vector<int> figures={3,5,7,11,13};
  vector<int> get;

  rep(i,3){
    for(int j=i+1;j<=3;j++){
      for(int k=j+1;k<=4;k++){
        get.push_back(figures[i]*figures[j]*figures[k]);
      }
    }
  }

  sort(ALL(get));
  
  if(N<105)cout << 0;
  if(N >= 105 && N < 165) cout << 1;
  if(N>=165 && N < 195) cout << 2;
  if(N >=195) cout << 3;
}