func_code_string: #include <bits/stdc++.h>   using namespace std;   int jie[2000050], i, ni[2000050], j, g[1000050], su[1000050], m;   bool vis[1000050];   int qmi(int di, int zhi) {     int ret = 1, x = di;     while (zhi) {       if (zhi & 1) ret = 1LL * ret * x % 1000000007;       x = 1LL * x * x % 1000000007;       zhi >>= 1;     }     return ret;   }   int main() {     jie[0] = jie[1] = ni[1] = ni[0] = 1;     for (i = 2; i <= 2000000; i++) jie[i] = 1LL * jie[i - 1] * i % 1000000007;     for (i = 1; i <= 2000000; i++) ni[i] = qmi(jie[i], 1000000007 - 2);     for (i = 2; i <= 1000000; i++) {       if (!vis[i]) {         g[i] = i;         su[++m] = i;       }       for (j = 1; j <= m; j++) {         if (i * su[j] > 1000000) break;         if (i % su[j]) {           g[i * su[j]] = su[j];           vis[i * su[j]] = true;         } else {           g[i * su[j]] = su[j];           vis[i * su[j]] = true;           break;         }       }     }     int t;     scanf( %d , &t);     while (t--) {       int r, x;       scanf( %d%d , &r, &x);       int ans = 1;       while (x != 1) {         int cnt = 0, psz = g[x];         while (x % psz == 0) x /= psz, cnt++;         ans = 1LL * ans *               (0LL +                2LL * (r + cnt >= cnt                           ? ((1LL * ni[r + cnt - cnt] * ni[cnt] % 1000000007) *                              jie[r + cnt] % 1000000007)                           : 0) -                (r + cnt - 1 >= cnt                     ? ((1LL * ni[r + cnt - 1 - cnt] * ni[cnt] % 1000000007) *                        jie[r + cnt - 1] % 1000000007)                     : 0)) %               1000000007;       }       printf( %d n , (ans + 1000000007) % 1000000007);     }     return 0;   }   