【Jason's_ACM_解题报告】Calculator Conundrum

最新推荐文章于 2022-05-20 18:56:36 发布

VIP文章 SarahLeigh

最新推荐文章于 2022-05-20 18:56:36 发布

阅读量342

点赞数

分类专栏： Jason's 文章标签：高效算法设计 STL Floyd判圈算法

本文链接：https://blog.csdn.net/dorileigh/article/details/43525527

版权

Calculator Conundrum

Alice got a hold of an old calculator that can display n digits. She was bored enough to come up with the following time waster. She enters a number k then repeatedly squares it until the result overflows. When the result overflows, only the n most significant digits are displayed on the screen and an error flag appears. Alice can clear the error and continue squaring the displayed number. She got bored by this soon enough, but wondered: “Given n and k, what is the largest number I can get by wasting time in this manner?”

Input
The first line of the input contains an integer t (1 ≤ t ≤ 200), the number of test cases. Each test case contains two integers n (1 ≤ n ≤ 9) and k (0 ≤ k < 10n) where n is the number of digits this calculator can display k is the starting number.

Output