Yroot of High-Precisions （luogu P2293 [HNOI2004]高精度开根）

Background\text{Background}Background

I’ve accepted\text{I've accepted}I’ve accepteda very good problem \text{ a very good problem } a very good problemabout High-Precisions and become\text{about High-Precisions and become}about High-Precisions and become

a little interested in it. (Copy my templates.)\text{a little interested in it. (Copy my templates.)}a little interested in it. (Copy my templates.)

Description\text{Description}Description

Given interger N,k. Please compute kN.\text{Given interger }N,k.\text{ Please compute }^k\sqrt{N}.Given interger N,k. Please compute kN​.

Solution\text{Solution}Solution

The easiest way I’ve got first is binary search.\text{The easiest way I've got first is binary search.}The easiest way I’ve got first is binary search.

To binary search for answer. For each answer a, use Quick-Power to \text{To binary search for answer. For each answer }a\text{, use Quick-Power to }To binary search for answer. For each answer a, use Quick-Power to 

compute ak.\text{compute }a^k.compute ak.

Time-complexity is O(log⁡n2k).\text{Time-complexity is }O(\log n^2k).Time-complexity is O(logn2k).