#213840 (Java21) No.587 七対子

• 問題: No.587 七対子
• ユーザー: hiromi_ayase
• 提出日時: 2017-11-03 22:26:19
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 79 ms / 2,000 ms
• コード長: 2,608 bytes
• コンパイル時間: 2,551 ms
• コンパイル使用メモリ: 82,808 KB
• 実行使用メモリ: 38,492 KB
• 最終ジャッジ日時: 2024-07-19 19:39:29
• 合計ジャッジ時間: 6,286 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	75 ms; 38,288 KB
testcase_01	AC	77 ms; 38,364 KB
testcase_02	AC	77 ms; 38,364 KB
testcase_03	AC	78 ms; 38,000 KB
testcase_04	AC	77 ms; 38,392 KB
testcase_05	AC	76 ms; 38,000 KB
testcase_06	AC	76 ms; 38,328 KB
testcase_07	AC	77 ms; 38,392 KB
testcase_08	AC	78 ms; 38,492 KB
testcase_09	AC	76 ms; 38,452 KB
testcase_10	AC	76 ms; 37,984 KB
testcase_11	AC	76 ms; 38,132 KB
testcase_12	AC	77 ms; 38,152 KB
testcase_13	AC	78 ms; 38,116 KB
testcase_14	AC	77 ms; 37,984 KB
testcase_15	AC	77 ms; 38,152 KB
testcase_16	AC	77 ms; 38,392 KB
testcase_17	AC	78 ms; 38,116 KB
testcase_18	AC	77 ms; 38,332 KB
testcase_19	AC	77 ms; 38,364 KB
testcase_20	AC	77 ms; 38,232 KB
testcase_21	AC	76 ms; 38,460 KB
testcase_22	AC	76 ms; 38,152 KB
testcase_23	AC	75 ms; 38,364 KB
testcase_24	AC	78 ms; 38,476 KB
testcase_25	AC	77 ms; 38,244 KB
testcase_26	AC	76 ms; 38,200 KB
testcase_27	AC	76 ms; 38,476 KB
testcase_28	AC	79 ms; 38,000 KB
testcase_29	AC	75 ms; 38,252 KB
testcase_30	AC	77 ms; 38,000 KB
testcase_31	AC	76 ms; 38,232 KB
testcase_32	AC	76 ms; 38,364 KB
testcase_33	AC	79 ms; 38,400 KB
testcase_34	AC	77 ms; 37,980 KB

ソースコード

public class Main {

	private static void solve() {
		char[] s = ns();
		int[] count = new int[26];
		for (char c : s) {
			count[c - 'a'] ++;
		}
		
		char x = 0;
		for (int i = 0; i < 26; i ++) {
			if (count[i] >= 3) {
				System.out.println("Impossible");
				return;
			} else if (count[i] == 1) {
				if (x == 0) {
					x = (char)(i + 'a');
				} else {
					System.out.println("Impossible");
					return;
				}
			}
		}
		System.out.println(x);
	}

	public static void main(String[] args) {
		new Thread(null, new Runnable() {
			@Override
			public void run() {
				long start = System.currentTimeMillis();
				String debug = args.length > 0 ? args[0] : null;
				if (debug != null) {
					try {
						is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
					} catch (Exception e) {
						throw new RuntimeException(e);
					}
				}
				reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
				solve();
				out.flush();
				tr((System.currentTimeMillis() - start) + "ms");
			}
		}, "", 64000000).start();
	}

	private static java.io.InputStream is = System.in;
	private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
	private static java.util.StringTokenizer tokenizer = null;
	private static java.io.BufferedReader reader;

	public static String next() {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			try {
				tokenizer = new java.util.StringTokenizer(reader.readLine());
			} catch (Exception e) {
				throw new RuntimeException(e);
			}
		}
		return tokenizer.nextToken();
	}

	private static double nd() {
		return Double.parseDouble(next());
	}

	private static long nl() {
		return Long.parseLong(next());
	}

	private static int[] na(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)
			a[i] = ni();
		return a;
	}

	private static char[] ns() {
		return next().toCharArray();
	}

	private static long[] nal(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++)
			a[i] = nl();
		return a;
	}

	private static int[][] ntable(int n, int m) {
		int[][] table = new int[n][m];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				table[i][j] = ni();
			}
		}
		return table;
	}

	private static int[][] nlist(int n, int m) {
		int[][] table = new int[m][n];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				table[j][i] = ni();
			}
		}
		return table;
	}

	private static int ni() {
		return Integer.parseInt(next());
	}

	private static void tr(Object... o) {
		if (is != System.in)
			System.out.println(java.util.Arrays.deepToString(o));
	}
}