func_code_string: #include <bits/stdc++.h>   using namespace std;   int q;   long long r, n;   vector<int> degp[1000005];   long long answ[1000005][21];   long long m = 1000000007;   long long powmod(long long x, long long po) {     if (po == 0) {       return 1;     }     long long res = powmod(x, po / 2);     res = (res * res) % m;     if (po % 2 == 1) {       res = (res * x) % m;     }     return res;   }   int main() {     for (int i = 2; i <= 1000000; i++) {       if (degp[i].empty()) {         long long t = i;         long long u = 1;         while (t <= 1000000) {           for (int j = 1; j <= 1000000 / t; j++) {             if (j % i != 0) {               degp[t * j].push_back(u);             }           }           u++;           t = t * (long long)i;         }       }     }     for (int i = 0; i <= 1000000; i++) {       answ[i][0] = 1;     }     for (int i = 1; i < 21; i++) {       answ[0][i] = 2;       for (int j = 1; j <= 1000000; j++) {         answ[j][i] = (answ[j - 1][i] + answ[j][i - 1]) % m;       }     }     scanf( %d , &q);     for (int i = 0; i < q; i++) {       scanf( %I64d%I64d , &r, &n);       long long res = 1;       for (int k = 0; k < degp[n].size(); k++) {         res = (res * answ[r][degp[n][k]]) % m;       }       printf( %I64d n , res);     }   }   