func_code_string: #include <bits/stdc++.h>   using namespace std;   int n, l, r;   long long ans;   int pr[10000005];   int cnt[10000005];   void solve() {     n--;     for (int i = (1); i <= (10000000); i++) pr[i] = i;     for (int i = (2); i <= (10000000); i++)       if (pr[i] == i) {         for (int j = i + i; j <= 10000000; j += i) {           if (pr[j] == j) pr[j] = i;         }       }     for (int i = (l); i <= (r); i++) {       int temp = 1, num = i, tc = 0, tp = 1;       while (num > 1) {         int np = pr[num];         if (np == tp) {           tc++;           if (tc >= n) tc = 0;         } else {           for (int j = (1); j <= (tc); j++) temp *= tp;           tp = np;           tc = 1 % n;         }         num /= np;       }       for (int j = (1); j <= (tc); j++) temp *= tp;       cnt[temp]++;     }     for (int i = (1); i <= (r); i++) ans += 1LL * cnt[i] * (cnt[i] - 1);     printf( %lld n , ans);   }   int main() {     scanf( %d %d %d , &n, &l, &r);     if (n == 1)       printf( %d n , r - l + 1);     else       solve();     return 0;   }   