#include #define FASTIO using namespace std; using ll = long long; using Vi = std::vector; using Vl = std::vector; using Pii = std::pair; using Pll = std::pair; template using min_priority_queue = std::priority_queue, std::greater>; constexpr int I_INF = std::numeric_limits::max(); constexpr ll L_INF = std::numeric_limits::max(); template inline bool chmin(T1& a, const T2& b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T1& a, const T2& b) { if (a < b) { a = b; return true; } return false; } template class Prints { private: class __Prints { public: __Prints(const char* sep, const char* term) : sep(sep), term(term) {} template #if __cplusplus >= 201703L auto operator()(const Args&... args) const -> decltype((os << ... << std::declval()), void()) { #else void operator()(const Args&... args) const { #endif print(args...); } template #if __cplusplus >= 201703L auto pvec(const T& vec, size_t sz) const -> decltype(os << std::declval()[0])>(), void()) { #else void pvec(const T& vec, size_t sz) const { #endif for (size_t i = 0; i < sz; i++) os << vec[i] << (i == sz - 1 ? term : sep); } template #if __cplusplus >= 201703L auto pmat(const T& mat, size_t h, size_t w) const -> decltype(os << std::declval()[0][0])>(), void()) { #else void pmat(const T& mat, size_t h, size_t w) const { #endif for (size_t i = 0; i < h; i++) for (size_t j = 0; j < w; j++) os << mat[i][j] << (j == w - 1 ? term : sep); } private: const char *sep, *term; void print() const { os << term; } void print_rest() const { os << term; } template void print(const T& head, const Tail&... tail) const { os << head, print_rest(tail...); } template void print_rest(const T& head, const Tail&... tail) const { os << sep << head, print_rest(tail...); } }; public: Prints() {} __Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); } }; Prints<> prints; Prints prints_err; //%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% void solve() { ll L, R; cin >> L >> R; ++R; int LIM = pow(R, 1.0 / 3.0) + 1; std::vector mpf(LIM + 1); std::vector primes; for (int i = 2; i <= LIM; i++) { if (mpf[i] == 0) { mpf[i] = i; primes.emplace_back(i); } for (const auto& p : primes) { if (i * p > LIM || p > mpf[i]) break; mpf[i * p] = p; } } Vl A(R - L); for (ll i = 0; i < R - L; i++) { A[i] = L + i; } for (auto p : primes) { for (ll i = (p - L % p) % p; i < R - L; i += p) { A[i] /= p; if (A[i] % p == 0) A[i] = -1; } } ll ans = 0; for (ll i = 0; i < R - L; i++) { if (A[i] == -1) continue; ll left = 2, right = R; while (right - left > 1) { ll mid = (left + right) >> 1; if (mid <= A[i] / mid) { left = mid; } else { right = mid; } } if (A[i] != left) ++ans; } prints()(ans); } //%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% int main() { #ifdef FASTIO std::cin.tie(nullptr), std::cout.tie(nullptr); std::ios::sync_with_stdio(false); #endif #ifdef FILEINPUT std::ifstream ifs("./in_out/input.txt"); std::cin.rdbuf(ifs.rdbuf()); #endif #ifdef FILEOUTPUT std::ofstream ofs("./in_out/output.txt"); std::cout.rdbuf(ofs.rdbuf()); #endif std::cout << std::setprecision(18) << std::fixed; solve(); std::cout << std::flush; return 0; }