csp.第32次认证 202312-2 因子化简

#include
#include
using namespace std;

const int N = 10000000;
int n,m;
long long a[13];
long long b[13],c[N];
int main()
{
   
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i] >> b[i];
    }
    for (int i = 0; i < n; i++)
    {


        for (int i = 0; i < N; i++)
        {
            c[i] = 0;
        }
        long long  ret = 1,j=2;
        long long t = a[i];
        while(t!=1)
        {

            if (t % j == 0)
            {
                c[j]++;
                t /= j;

            }
            else
            {
                j++;
            }

        }
       

        for ( m =2; m =b[i])
            {

                ret =ret*pow(m,c[m]);
            }
        }
        cout << ret << endl;
    }



}