CF26A.Almost Prime

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers which are between 1 and nn , inclusive.

输入格式

Input contains one integer number nn ( 1<=n<=30001<=n<=3000 ).

输出格式

Output the amount of almost prime numbers between 1 and nn , inclusive.

输入输出样例

  • 输入#1

    10
    

    输出#1

    2
    
  • 输入#2

    21
    

    输出#2

    8
    
首页