Submission #207639

---

Source Code Expand

import java.util.HashSet;
import java.util.Set;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int num = scanner.nextInt();
		String str1 = scanner.next();
		String str2 = scanner.next();
		String word = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";

		char[] chr1 = str1.toCharArray();
		char[] chr2 = str2.toCharArray();

		Set<Character> knownChar = new HashSet<Character>();
		Set<Character> existChar = new HashSet<Character>();

		for (int i = 0; i < num; ++i) {
			if (isAlpha(chr1[i]) && isAlpha(chr2[i])) {

			} else if (isAlpha(chr1[i])) {
				knownChar.add(chr1[i]);
			} else if (isAlpha(chr2[i])) {
				knownChar.add(chr2[i]);
			}
		}

		boolean flag = true;
		while (flag) {
			flag = false;
			for (int i = 0; i < num; ++i) {
				if (isAlpha(chr1[i]) && isAlpha(chr2[i])) {
					if (knownChar.contains(chr1[i])
							|| knownChar.contains(chr2[i])) {
						if (!(knownChar.contains(chr1[i])
								&& knownChar.contains(chr2[i]))) {
							knownChar.add(chr1[i]);
							knownChar.add(chr2[i]);
							flag = true;
						}
					}
				}
			}
		}

		String ans = "1";

		for (int i = 0; i < num; ++i) {
			if (i == 0) {
				if (isAlpha(chr1[i]) && isAlpha(chr2[i])) {
					if (!knownChar.contains(chr1[i])
							&& !knownChar.contains(chr2[i])) {
						ans = "9";
					}
				}

				if (isAlpha(chr1[i])) {
					existChar.add(chr1[i]);
				} 
				if (isAlpha(chr2[i])) {
					existChar.add(chr2[i]);
				}
			} else {
				if (isAlpha(chr1[i]) && isAlpha(chr2[i])) {
					if (!knownChar.contains(chr1[i])
							&& !knownChar.contains(chr2[i])) {
						if (!existChar.contains(chr1[i])
								&& !existChar.contains(chr2[i])) {
							ans += "0";
						}
					}
				}
				if (isAlpha(chr1[i])) {
					existChar.add(chr1[i]);
				}
				if (isAlpha(chr2[i])) {
					existChar.add(chr2[i]);
				}
			}
		}
		
		System.out.println(ans);
	}

	private static boolean isAlpha(char c) {
		if (c >= 'A' && c <= 'Z') {
			return true;
		}
		return false;
	}
}

Submission Info

Judge Result