結果

問題 No.443 GCD of Permutation
ユーザー hiromi_ayasehiromi_ayase
提出日時 2016-11-11 23:13:37
言語 Java21
(openjdk 21)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 4,423 bytes
コンパイル時間 3,840 ms
コンパイル使用メモリ 74,296 KB
実行使用メモリ 50,552 KB
最終ジャッジ日時 2023-08-16 20:32:21
合計ジャッジ時間 6,612 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
49,000 KB
testcase_01 AC 38 ms
49,160 KB
testcase_02 AC 38 ms
49,244 KB
testcase_03 AC 40 ms
49,388 KB
testcase_04 AC 56 ms
50,552 KB
testcase_05 AC 38 ms
49,004 KB
testcase_06 AC 39 ms
49,292 KB
testcase_07 AC 41 ms
49,176 KB
testcase_08 AC 41 ms
49,364 KB
testcase_09 AC 42 ms
49,088 KB
testcase_10 AC 41 ms
49,260 KB
testcase_11 AC 41 ms
49,448 KB
testcase_12 AC 40 ms
49,376 KB
testcase_13 AC 40 ms
49,364 KB
testcase_14 AC 48 ms
49,380 KB
testcase_15 AC 44 ms
49,324 KB
testcase_16 AC 43 ms
49,404 KB
testcase_17 AC 44 ms
49,244 KB
testcase_18 AC 48 ms
49,776 KB
testcase_19 AC 43 ms
49,228 KB
testcase_20 AC 47 ms
49,004 KB
testcase_21 AC 43 ms
49,404 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 AC 48 ms
49,088 KB
testcase_26 WA -
testcase_27 WA -
testcase_28 AC 47 ms
49,352 KB
testcase_29 WA -
testcase_30 AC 48 ms
49,292 KB
testcase_31 AC 51 ms
49,408 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;

public class Main {
	public static void main(String[] args) {
		FastScanner sc = new FastScanner();
		char[] N = sc.next().toCharArray();
		if (N.length < 10) {
			long ret = solve2(N);
			System.out.println(ret);
		} else {
			int ret = solve(N);
			if (ret == 0) {
				System.out.println(N);
			} else {
				System.out.println(ret);
			}
		}
	}

	private static long solve2(char[] N) {
		gcd = Long.parseLong(new String(N));
		dfs(new boolean[N.length], N, 0, 0);
		return gcd;
	}

	private static long gcd;

	private static void dfs(boolean[] flg, char[] N, long now, int depth) {
		if (depth == flg.length) {
			gcd = gcd(gcd, now);
		}
		for (int i = 0; i < flg.length; i++) {
			if (!flg[i]) {
				flg[i] = true;
				dfs(flg, N, now * 10 + (N[i] - '0'), depth + 1);
				flg[i] = false;
			}
		}
	}

	public static long gcd(long a, long b) {
		while (b > 0) {
			long c = a;
			a = b;
			b = c % b;
		}
		return a;
	}

	private static int solve(char[] N) {
		int n = N.length;
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = N[i] - '0';
		}

		boolean sameFlg = true;
		int sum = 0;
		boolean mod2 = true;
		boolean mod4 = true;
		boolean mod8 = true;
		boolean mod5 = true;
		boolean mod7 = true;

		for (int i = 0; i < n; i++) {
			if (a[i] != a[0]) {
				sameFlg = false;
			}
			sum += a[i];

			if (a[i] % 4 != 0) {
				mod4 = false;
			}
			if (a[i] % 8 != 0) {
				mod8 = false;
			}
			if (a[i] % 2 != 0) {
				mod2 = false;
			}
			if (a[i] % 5 != 0) {
				mod5 = false;
			}
			if (a[i] % 7 != 0) {
				mod7 = false;
			}
		}

		if (sameFlg) {
			return 0;
		}

		int ret = 1;
		if (mod8) {
			ret *= 8;
		} else if (mod4) {
			ret *= 4;
		} else if (mod2) {
			ret *= 2;
		}

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

		if (mod5) {
			ret *= 5;
		}
		if (mod7) {
			ret *= 7;
		}
		return ret;
	}

}

class FastScanner {
	public static String debug = null;

	private final InputStream in = System.in;
	private int ptr = 0;
	private int buflen = 0;
	private byte[] buffer = new byte[1024];
	private boolean eos = false;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				if (debug != null) {
					buflen = debug.length();
					buffer = debug.getBytes();
					debug = "";
					eos = true;
				} else {
					buflen = in.read(buffer);
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen < 0) {
				eos = true;
				return false;
			} else if (buflen == 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean isEOS() {
		return this.eos;
	}

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

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

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

	public int nextInt() {
		return (int) nextLong();
	}

	public long[] nextLongList(int n) {
		return nextLongTable(1, n)[0];
	}

	public int[] nextIntList(int n) {
		return nextIntTable(1, n)[0];
	}

	public long[][] nextLongTable(int n, int m) {
		long[][] ret = new long[n][m];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				ret[i][j] = nextLong();
			}
		}
		return ret;
	}

	public int[][] nextIntTable(int n, int m) {
		int[][] ret = new int[n][m];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				ret[i][j] = nextInt();
			}
		}
		return ret;
	}
}
0