题解 | #幂次进近#

提供一个码量小，无__int128的ac代码，不保证所有场景都正确((

#include <iostream>
#include <cmath>
#include <algorithm>

using namespace std;

void solve() {
    long long n, k;
    cin >> n >> k;

    long double ld_n = n;
    long long m = pow(ld_n, 1.0 / k);

    long double val1 = pow((long double)m, k);
    long double val2 = pow((long double)(m + 1), k);

    if (abs(ld_n - val1) <= abs(ld_n - val2))
        cout << m << endl;
    else
        cout << m + 1 << endl;

}

int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);

    int t;
    cin >> t;
    while (t--) solve();

    return 0;
}