#130091 (Java) No.443 GCD of Permutation

• 問題: No.443 GCD of Permutation
• ユーザー: Grenache
• 提出日時: 2016-11-12 01:58:25
• 言語: Java (openjdk 23)
• 結果: WA (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 5,547 bytes
• コンパイル時間: 3,616 ms
• コンパイル使用メモリ: 80,816 KB
• 実行使用メモリ: 38,416 KB
• 最終ジャッジ日時: 2024-11-27 11:01:23
• 合計ジャッジ時間: 6,406 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
sample	AC * 4
other	AC * 26 WA * 2

ソースコード

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


public class Main_yukicoder443_1 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		char[] n = sc.next().toCharArray();

//		for (int j = 1; j < 1000; j++) {

//			char[] n = Integer.toString(j).toCharArray();
//			pr.println(n);

		Set<Integer> hs = new TreeSet<>();
		int sum = 0;
		for (char c : n) {
			hs.add(c - '0');
			sum += c - '0';
		}

		if (hs.size() == 1) {
			pr.println(n);
		} else {
			List<Integer> list = new ArrayList<>(hs);
			int max = 0;
			for (int i = 1, size = hs.size(); i < size; i++) {
				max = Math.max(max, list.get(i) - list.get(i - 1));
			}

			int ret = 1;
			if (!hs.contains(1) && !hs.contains(3) && !hs.contains(5) && !hs.contains(7) && !hs.contains(9)) {
				if (!hs.contains(2) && !hs.contains(4) && !hs.contains(6)) {
					ret *= 8;
				} else if (!hs.contains(2) && !hs.contains(6)) {
					ret *= 4;
				} else {
					ret *= 2;
				}
			}

			if (!hs.contains(1) && !hs.contains(2) && !hs.contains(3) && !hs.contains(4) && !hs.contains(6)
					&& !hs.contains(7) && !hs.contains(8) && !hs.contains(9)) {
				ret *= 5;
			}

			if (!hs.contains(1) && !hs.contains(2) && !hs.contains(3) && !hs.contains(4) && !hs.contains(5)
					&& !hs.contains(6) && !hs.contains(8) && !hs.contains(9)) {
				ret *= 7;
			} else if (max == 7 && n.length % 3 == 0) {
				int sum1 = 0;
				int sum2 = 0;
				for (int i = 0, size = n.length; i < size; i++) {
					if (i % 6 == 0 || i % 6 == 1 || i % 6 == 2) {
						sum1 += n[i] - '0';
					} else {
						sum2 += n[i] - '0';
					}
				}

				if (Math.abs(sum1 - sum2) % 7 == 0) {
					ret *= 7;
				}
			}

			if (sum % 3 == 0) {
				if (sum % 81 == 0) {
					ret *= 81;
				} else if (sum % 9 == 0) {
					ret *= 9;
				} else {
					ret *= 3;
				}
			}

			pr.println(ret);
		}
//		}
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

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

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}