UVa11549 - Calculator Conundrum (Floyd判圈法)

Problem C

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?”

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

import java.io.IOException;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.io.PrintWriter;
import java.io.OutputStreamWriter;
import java.io.StreamTokenizer;

public class Main
{
	public static boolean DEBUG = false;
	public BufferedReader cin;
	public PrintWriter cout;
	public StreamTokenizer tokenizer;
	public long n, k;
	
	public void init()
	{
		try {
			if (DEBUG) {
				cin = new BufferedReader(new InputStreamReader(
						new FileInputStream("d:\\OJ\\uva_in.txt")));
			} else {
				cin = new BufferedReader(new InputStreamReader(System.in));
			}
		} catch (IOException e) {

		}
		
		cout = new PrintWriter(new OutputStreamWriter(System.out));
		tokenizer = new StreamTokenizer(cin);
	}
	
	public String next()
	{
		try {
			tokenizer.nextToken();
			//System.out.println("ttype:" + tokenizer.ttype);
			if (tokenizer.ttype == StreamTokenizer.TT_EOF)
				return null;
			else if (tokenizer.ttype == StreamTokenizer.TT_WORD)
				return tokenizer.sval;
			else if (tokenizer.ttype == StreamTokenizer.TT_NUMBER) 
				return String.valueOf((int)tokenizer.nval);
		} catch (IOException e) {

		}
		
		return null;
		
	}
	
	public void input()
	{
		try {
			n = Long.parseLong(next());
			
			k = Long.parseLong(next());
		} catch (Exception e) {

		}
	}
	
	public int convert(long num)
	{
		int[] buf = new int[30];
		int len = 0;
		
		long tmp = num * num;
		
		while (tmp != 0) {
			buf[len++] = (int)(tmp % 10);
			tmp /= 10;
		}
		
		long tmpn = n;
		if (tmpn > len) {
			tmpn = len;
		}
		
		int ans = 0;
		for (long i = 0; i < tmpn; i++) {
			ans = ans * 10 + buf[--len];
		}
		
		return ans;
	}
	
	public void solve()
	{
		long k1 = k, k2 = k;
		long ans = k;
		
		do {
			k1 = convert(k1);
			k2 = convert(k2);
			if (k2 > ans) ans = k2;
			k2 = convert(k2);
			if (k2 > ans) ans = k2;
		} while (k1 != k2);
		
		cout.println(ans);
		cout.flush();
	}
	
	public static void main(String[] args)
	{
		try {
			Main solver = new Main();
			solver.init();

			int t = Integer.parseInt(solver.next());
			
			while (t-- > 0) {
				solver.input();
				solver.solve();
			}
		} catch (Exception e) {

		}
	}
}