結果

問題 No.587 七対子
ユーザー YukimotoPGYukimotoPG
提出日時 2019-03-29 23:45:46
言語 Java21
(openjdk 21)
結果
AC  
実行時間 53 ms / 2,000 ms
コード長 3,764 bytes
コンパイル時間 2,975 ms
コンパイル使用メモリ 89,780 KB
実行使用メモリ 37,036 KB
最終ジャッジ日時 2024-07-19 19:59:13
合計ジャッジ時間 5,784 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 47 ms
36,660 KB
testcase_01 AC 49 ms
36,760 KB
testcase_02 AC 48 ms
36,904 KB
testcase_03 AC 46 ms
36,648 KB
testcase_04 AC 48 ms
36,804 KB
testcase_05 AC 48 ms
36,736 KB
testcase_06 AC 48 ms
36,820 KB
testcase_07 AC 49 ms
36,852 KB
testcase_08 AC 47 ms
36,892 KB
testcase_09 AC 50 ms
36,364 KB
testcase_10 AC 49 ms
36,788 KB
testcase_11 AC 48 ms
36,764 KB
testcase_12 AC 47 ms
36,524 KB
testcase_13 AC 47 ms
36,608 KB
testcase_14 AC 49 ms
36,628 KB
testcase_15 AC 50 ms
36,708 KB
testcase_16 AC 48 ms
37,036 KB
testcase_17 AC 50 ms
36,672 KB
testcase_18 AC 49 ms
36,504 KB
testcase_19 AC 48 ms
36,900 KB
testcase_20 AC 50 ms
36,804 KB
testcase_21 AC 49 ms
36,916 KB
testcase_22 AC 49 ms
36,936 KB
testcase_23 AC 49 ms
36,732 KB
testcase_24 AC 47 ms
36,796 KB
testcase_25 AC 50 ms
36,904 KB
testcase_26 AC 49 ms
36,652 KB
testcase_27 AC 49 ms
36,392 KB
testcase_28 AC 47 ms
36,964 KB
testcase_29 AC 46 ms
36,784 KB
testcase_30 AC 48 ms
36,876 KB
testcase_31 AC 50 ms
36,744 KB
testcase_32 AC 49 ms
36,368 KB
testcase_33 AC 50 ms
36,764 KB
testcase_34 AC 53 ms
36,840 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class Main {

	void solve (FastScanner in, PrintWriter out, Methods ms) {
		
		char[] a = in.next().toCharArray();
		int[] alphabet = new int[26];
		
		for (int i=0; i<a.length; i++) {
			alphabet[a[i]-97]++;
		}
		
		int oneNum = 0, twoNum = 0;
		char oneNumChar = 0;
		for (int i=0; i<26; i++) {
			if (alphabet[i] == 1) {
				oneNum++;
				oneNumChar = (char)(i+97);
			}
			else if (alphabet[i] == 2) twoNum++;
		}
		
		out.println(oneNum==1&&twoNum==6? oneNumChar : "Impossible");
		
	}



	public static void main(String[] args) {
		Main main = new Main();
		FastScanner in = new FastScanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		Methods ms = new Methods();
		main.solve(in, out, ms);
		in.close();
		out.close();
	}

	static class Methods {

		public void print (Object... ar) {System.out.println(Arrays.deepToString(ar));}

		public void yesno (PrintWriter out, boolean b) {out.println(b?"Yes":"No");}

		public void YESNO (PrintWriter out, boolean b) {out.println(b?"YES":"NO");}

		public int max (int... ar) {Arrays.sort(ar); return ar[ar.length-1];}

		public int min (int... ar) {Arrays.sort(ar); return ar[0];}
		
		public boolean isPrime (int n) {
			if (n==2) return true;
			if (n<2 || n%2==0) return false;
			double d = Math.sqrt(n);
			for (int i=3; i<=d; i+=2) if(n%i==0){return false;}
			return true;
		}

		public long gcd (long a, long b) {return b>0?gcd(b,a%b):a;}

		public long lcm (long a, long b) {return a/gcd(a,b)*b;}

	}

	static class FastScanner {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private  int length = 0, p = 0;

		public FastScanner (InputStream stream) {
			in = stream;
		}

		public boolean hasNextByte () {
			if (p < length) return true;
			else {
				p = 0;
				try {length = in.read(buffer);}
				catch (Exception e) {e.printStackTrace();}
				if (length <= 0) return false;
			}
			return true;
		}

		public int readByte () {
			if (hasNextByte() == true) return buffer[p++];
			return -1;
		}

		public boolean isPrintable (int n) {return 33<=n&&n<=126;}

		public void skip () {
			while (hasNextByte() && !isPrintable(buffer[p])) p++;
		}

		public boolean hasNext () {skip(); return hasNextByte();}

		public String next () {
			if (!hasNext()) throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int t = readByte();
			while (isPrintable(t)) {
				sb.appendCodePoint(t);
				t = readByte();
			}
			return sb.toString();
		}

		public String[] nextArray (int n) {
			String[] ar = new String[n];
			for (int i=0; i<n; i++) ar[i] = next();
			return ar;
		}

		public int nextInt () {return Math.toIntExact(nextLong());}

		public int[] nextIntArray (int n) {
			int[] ar = new int[n];
			for (int i=0; i<n; i++) ar[i] = nextInt();
			return ar;
		}

		public long nextLong () {
			if (!hasNext()) throw new NoSuchElementException();
			boolean minus = false;
			int temp = readByte();
			if (temp == '-') {
				minus = true;
				temp = readByte();
			}
			if (temp<'0' || '9'<temp) throw new NumberFormatException();
			long n = 0;
			while (isPrintable(temp)) {
				if ('0'<=temp && temp<='9') {
					n *= 10;
					n += temp - '0';
				}
				else throw new NumberFormatException();
				temp = readByte();
			}
			return minus? -n : n;
		}

		public long[] nextLongArray (int n) {
			long[] ar = new long[n];
			for (int i=0; i<n; i++) ar[i] = nextLong();
			return ar;
		}

		public double nextDouble () {
			return Double.parseDouble(next());
		}

		public double[] nextDoubleArray (int n) {
			double[] ar = new double[n];
			for (int i=0; i<n; i++) ar[i] = nextDouble();
			return ar;
		}

		public void close () {
			try {in.close();}
			catch(Exception e){}
		}

	}

}
0