这篇博客探讨了一个关于旧计算器的问题，当输入数字k并反复平方直到结果溢出时，只显示最后n位数字。作者求解给定n和k时，Alice能通过这种操作得到的最大数字。博客提到了三种解决方案，包括使用stringstream、自定义next函数和Floyd判圈算法，其中Floyd算法在效率和空间占用上表现最优。
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
最低0.47元/天 解锁文章
590
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
