結果
問題 | No.443 GCD of Permutation |
ユーザー | Grenache |
提出日時 | 2016-11-11 23:48:41 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,052 bytes |
コンパイル時間 | 4,175 ms |
コンパイル使用メモリ | 80,680 KB |
実行使用メモリ | 38,608 KB |
最終ジャッジ日時 | 2024-05-04 03:25:50 |
合計ジャッジ時間 | 7,314 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 48 ms
36,796 KB |
testcase_02 | AC | 48 ms
37,504 KB |
testcase_03 | AC | 49 ms
37,236 KB |
testcase_04 | AC | 49 ms
37,104 KB |
testcase_05 | AC | 48 ms
37,376 KB |
testcase_06 | AC | 50 ms
37,332 KB |
testcase_07 | AC | 49 ms
36,812 KB |
testcase_08 | AC | 48 ms
37,152 KB |
testcase_09 | AC | 50 ms
37,152 KB |
testcase_10 | AC | 50 ms
37,168 KB |
testcase_11 | WA | - |
testcase_12 | AC | 49 ms
37,152 KB |
testcase_13 | AC | 49 ms
37,432 KB |
testcase_14 | AC | 88 ms
38,200 KB |
testcase_15 | AC | 55 ms
37,456 KB |
testcase_16 | AC | 49 ms
37,264 KB |
testcase_17 | AC | 52 ms
37,220 KB |
testcase_18 | AC | 79 ms
38,164 KB |
testcase_19 | AC | 50 ms
37,104 KB |
testcase_20 | AC | 78 ms
37,536 KB |
testcase_21 | AC | 55 ms
37,420 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 73 ms
38,400 KB |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 78 ms
38,092 KB |
testcase_29 | WA | - |
testcase_30 | AC | 82 ms
38,344 KB |
testcase_31 | AC | 84 ms
38,608 KB |
ソースコード
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(); 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; } if (sum % 3 == 0) { 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); } } }