Untitled

int nthRoot(int m, int n) {
    double low = 1;
    double high = m;
    
    while(((int)high - (int)low) >= 1) {
        double mid = (low + high) / 2.0; 
        if(multiply(mid, n) <= m) {
            low = mid; 
        }
        else {
            high = mid; 
        }
    }
    return (int)low;
    
}