UVA 11549 Calculator Conundrum

原文请訪问我的博客：http://xiaoshig.sinaapp.com/?p=115

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?

”

Program 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 < 10ⁿ) where n is the number of digits this calculator can display k is the starting number.

Program Output

For each test case, print the maximum number that Alice can get by repeatedly squaring the starting number as described.

Sample Input & Output

INPUT

2
1 6
2 99

OUTPUT

9
99

#include<iostream>
#include<set>
#include<sstream>
using namespace std;
int next(int n,int k)
{stringstream ss;ss<<( long) k*k;string s=ss.str();if(s.length()>n)s=s.substr(0,n);int ans;stringstream ss2(s);ss2>>ans;return ans;
}
int main()
{int t;cin>>t;while(t--){int n,k;cin>>n>>k;set<int> s;int ans=k;while(!s.count(k)){s.insert(k);if(k>ans)ans=k;k=next(n,k);}cout<<ans<<endl;}
return 0;
}

转载于:https://www.cnblogs.com/zfyouxi/p/5229639.html

UVA 11549 Calculator Conundrum相关推荐

UVa 11549 Calculator Conundrum
大白书里面的题感觉就是没有什么固定的思路,只能认真理解学习汝佳大大的代码. 这里用的Floyd判圈法,就像插图里面的一样,两个小孩,一个快一个慢,如果实在一个环形跑道,那么快的那个最终一定会" ...
UVA 11549 Calculator Conundrum
很容看出来,一直平方又只取前面n位会构成循环,所以可以模拟,判重的话就用hash #include <iostream> #include <cstdio> #include ...
UVa 11549 Calculator Conundrum (训练指南，Floyd 判圈算法)
算法竞赛训练指南, 42 页注意: 1. 用数组来记录一个数的各位的数字 2. 快慢指针来记录链表环的入点(Floyd 判圈算法) #include <cstdio> #include ...
UVA 11549 Calculator Conundrum 题解
题解: 题目暗示了计算机显示出的数将出现循环,最直接的方式是一个一个的模拟,并判断新得到的数字是否出现过.最简单的方式是通过数组记录已经出现过的数字,然而题目中 0<=k<=10^9 范围 ...
UVa 11549 - Calculator Conundrum
題目:計算k^2^m中,前n位構成的最大數字. 分析:數論,循環.找尋環節不斷的計算k^2^m和k^4^m相等時即為循環節. 說明:也可以使用map檢測循環╮(╯▽╰)╭. #include < ...
UVA之11549 - Calculator Conundrum
[题目] Problem C CALCULATOR CONUNDRUM Alice got a hold of an old calculator that can displayndigits. S ...
UVA 11549 calcular conundrum 计算机老谜题
题目大意用一个老式计算器,只显示n位数字,输入一个整数k后计算,计算器会反复平方,直至溢出,每次溢出只显示最高的n位,计算器会一直平方下去,直到出现重复的数字分析题目中已经暗示了计算器显示的数会 ...
Calculator Conundrum UVA - 11549（floyd判圈）
Calculator Conundrum UVA - 11549 题意: 给你一个n和k. 每次操作可以把k平方,之后取k*k的前n位为 k. 思路: 首先可以想到,经过有限次操作后,会出现循环. ...
UVA 11549 模拟 Floyed判圈法的应用 Calculator Conundrum
此题很容易想到会出现环,那么就可以想到用map来判重,但是此题还有一种更加优越的所需空间复杂度为o(1)的算法 . #include<cstdio> #include<iostrea ...

UVA 11549 Calculator Conundrum

UVA 11549 Calculator Conundrum相关推荐

最新文章

热门文章