結果

問題 No.443 GCD of Permutation
ユーザー GrenacheGrenache
提出日時 2016-11-12 11:19:12
言語 Java21
(openjdk 21)
結果
AC  
実行時間 89 ms / 1,000 ms
コード長 4,395 bytes
コンパイル時間 3,815 ms
コンパイル使用メモリ 79,748 KB
実行使用メモリ 38,320 KB
最終ジャッジ日時 2024-10-13 23:48:24
合計ジャッジ時間 6,227 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
37,028 KB
testcase_01 AC 49 ms
36,824 KB
testcase_02 AC 50 ms
37,120 KB
testcase_03 AC 52 ms
37,028 KB
testcase_04 AC 51 ms
36,840 KB
testcase_05 AC 50 ms
36,824 KB
testcase_06 AC 52 ms
37,056 KB
testcase_07 AC 52 ms
36,916 KB
testcase_08 AC 49 ms
36,824 KB
testcase_09 AC 51 ms
36,896 KB
testcase_10 AC 48 ms
37,116 KB
testcase_11 AC 50 ms
36,960 KB
testcase_12 AC 49 ms
37,080 KB
testcase_13 AC 51 ms
36,840 KB
testcase_14 AC 84 ms
38,104 KB
testcase_15 AC 56 ms
36,840 KB
testcase_16 AC 53 ms
37,056 KB
testcase_17 AC 56 ms
37,080 KB
testcase_18 AC 80 ms
38,316 KB
testcase_19 AC 54 ms
37,160 KB
testcase_20 AC 72 ms
38,144 KB
testcase_21 AC 58 ms
36,568 KB
testcase_22 AC 49 ms
36,696 KB
testcase_23 AC 50 ms
37,184 KB
testcase_24 AC 50 ms
36,684 KB
testcase_25 AC 78 ms
38,320 KB
testcase_26 AC 78 ms
37,920 KB
testcase_27 AC 60 ms
37,196 KB
testcase_28 AC 79 ms
38,224 KB
testcase_29 AC 89 ms
38,056 KB
testcase_30 AC 88 ms
38,060 KB
testcase_31 AC 89 ms
38,176 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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


public class Main_yukicoder443 {

	private static Scanner sc;
	private static Printer pr;

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

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

		if (hs.size() == 1) {
			pr.println(n);
		} else {
			int gcd = 0;
			for (int i : hs) {
				for (int j : hs) {
					gcd = gcd(gcd, Math.abs(i - j) * 9);
				}
			}

			int mod = 0;
			for (char c : n) {
				mod *= 10;
				mod = (mod + (c - '0')) % gcd;
			}

			pr.println(gcd(mod, gcd));
		}
	}

	private static int gcd(int n, int m) {
		if (m == 0) {
			return n;
		} else {
			return gcd(m, n % m);
		}
	}

	// ---------------------------------------------------
	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);
		}
	}
}
0