3065304_wa.java

北大大牛代码 1240道题的原代码 超级权威

import java.util.*;

public class Main
{
	public static String change(String num)
	{
		String ret;
		
		ret = "";
		for(int i = 0; i < 10; i++)
		{
			int cnt = 0;
			for(int j = 0; j < num.length(); j++)
			{
				if(num.charAt(j)=='0'+i)
				{
					cnt++;
				}
			}
			if(cnt!=0)
			{
				ret += Integer.toString(cnt)+Integer.toString(i);
			}
		}
		return ret;
	}
	
	public static void main(String [] arvs)
	{
		Scanner cin = new Scanner (System.in);
		String num, tmp;
		int n, j;
		String array[] = new String [16];
		
		while(true)
		{
			num = cin.next();
			if(num.compareTo("-1")==0)
			{
				break;
			}
			System.out.print(num);
			array[1] = num;
			tmp = change(num);
			if(tmp.compareTo(num)==0)
			{
				System.out.println(" is self-inventorying");
				continue;
			}
			boolean mark = false;
			array[2] = tmp;
			loop:
			for(j = 3; j <= 15; j++)
			{
				array[j] = change(tmp);
				if(tmp.compareTo(array[j])==0)
				{
					mark = true;
					System.out.println(" is self-inventorying after "+(j-2)+" steps");
					break;
				}
				tmp = array[j];
				for(int k = 1; k < j; k++)
				{
					if(tmp.compareTo(array[k])==0)
					{
						mark = true;
						System.out.println(" enters an inventory loop of length "+(j-k));
						break loop;
					}
				}
			}
			if(!mark)
			{
				System.out.println(" can not be classified after 15 iterations");
			}
		}
	}
}