func_code_string: #include <bits/stdc++.h>   using namespace std;   int l, r, p, prim[100], cnt, a[4000000], n, f[4000000], ans;   bool ok[4000000];   void DFS(int x, long long now) {     if (x > cnt) return;     while (now <= r) {       DFS(x + 1, now);       now = now * prim[x];       if (now <= r) a[++n] = now;     }   }   int main() {     scanf( %d%d%d , &l, &r, &p);     for (int i = 2; i <= p; ++i) {       bool OK = true;       for (int j = 2; j * j <= i; ++j)         if (i % j == 0) {           OK = false;           break;         }       if (OK) prim[++cnt] = i;     }     a[++n] = 1;     DFS(1, 1);     sort(a + 1, a + n + 1);     for (int i = 2; i <= n; ++i) f[i] = p + 1;     for (int q = 1; q <= p; ++q) {       int now = 1;       for (int i = 1; i <= n; ++i) {         long long tmp = a[i] * q;         while (now <= n && a[now] < tmp) ++now;         if (now > n) break;         if (a[now] == tmp && f[now] > f[i] + 1) {           f[now] = f[i] + 1;           if (f[now] + q <= p) ok[now] = 1;         }       }     }     for (int i = 1; i <= n; ++i)       if (a[i] >= l && ok[i]) ++ans;     printf( %d n , ans);     return 0;   }   