UVa 10192 - Vacation

/*
 * UVa 10192 - Vacation
 * */
import java.util.Scanner;

class Main {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int count = 0;
		String s1,s2;
		while (true) {
			count++;
			char[] c1=null,c2=null;
			s1 = scanner.nextLine();
			if(s1.length() > 0) {
				c1 = s1.toCharArray(); 
				if (c1[0] == '#')
					return;
			}
			s2 = scanner.nextLine();
			if(s2.length() > 0) {
				c2 = s2.toCharArray();
				if (c2[0] == '#')
					return;
			}
			int n1 = s1.length();
			int n2 = s2.length();
			int[][] c = new int[n1 + 5][n2 + 5];
			for (int i = 1; i <= n1; i++) {
				for (int j = 1; j <= n2; j++) {
					if (c1[i - 1] == c2[j - 1])
						c[i][j] = c[i - 1][j - 1] + 1;
					else if (c[i - 1][j] >= c[i][j - 1])
						c[i][j] = c[i - 1][j];
					else
						c[i][j] = c[i][j - 1];
				}
			}
			System.out.println("Case #" + count + ": you can visit at most "
					+ c[n1][n2] + " cities.");
		}
	}
}