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: Accepted)

#include<bits/stdc++.h>
using namespace std;
using ll=long long int;
#define rep(i,n) for(int i=0;i<(n);i++)

int main(){
    int n;
    cin>>n;
    
   
    int ans=0;
    for(int j=1;j<=n;j+=2){
        long double limit=sqrt(j);
        int honlimit=floor(limit);
        int cnt=0;
        for(int i=1;i<limit;i++){
            if(j%i==0){
                cnt+=1;
                
            }

        }
        if(honlimit==limit && j%honlimit==0 && cnt==4)ans+=0;
        else if(cnt==4)ans+=1;
        
    }
    cout<<ans<<endl;
}