結果
問題 | No.358 も~っと!門松列 |
ユーザー | Suunn |
提出日時 | 2019-02-22 09:37:40 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 53 ms / 1,000 ms |
コード長 | 3,355 bytes |
コンパイル時間 | 2,015 ms |
コンパイル使用メモリ | 78,104 KB |
実行使用メモリ | 50,168 KB |
最終ジャッジ日時 | 2024-11-23 17:54:26 |
合計ジャッジ時間 | 4,224 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 51 ms
49,640 KB |
testcase_01 | AC | 51 ms
50,044 KB |
testcase_02 | AC | 51 ms
49,964 KB |
testcase_03 | AC | 52 ms
50,032 KB |
testcase_04 | AC | 53 ms
50,064 KB |
testcase_05 | AC | 51 ms
49,696 KB |
testcase_06 | AC | 51 ms
49,528 KB |
testcase_07 | AC | 51 ms
49,568 KB |
testcase_08 | AC | 51 ms
49,776 KB |
testcase_09 | AC | 49 ms
49,616 KB |
testcase_10 | AC | 50 ms
50,044 KB |
testcase_11 | AC | 50 ms
49,676 KB |
testcase_12 | AC | 50 ms
49,640 KB |
testcase_13 | AC | 51 ms
49,592 KB |
testcase_14 | AC | 49 ms
49,864 KB |
testcase_15 | AC | 51 ms
50,168 KB |
testcase_16 | AC | 51 ms
49,792 KB |
testcase_17 | AC | 50 ms
49,808 KB |
testcase_18 | AC | 50 ms
49,872 KB |
testcase_19 | AC | 51 ms
50,016 KB |
testcase_20 | AC | 51 ms
49,764 KB |
testcase_21 | AC | 51 ms
50,024 KB |
testcase_22 | AC | 51 ms
49,876 KB |
ソースコード
import java.io.IOException; import java.util.NoSuchElementException; public class Main{ static long dp[] = new long[51]; public static void main(String[] args){ FastScanner sc = new FastScanner(); int A = sc.nextInt(); int B = sc.nextInt(); int C = sc.nextInt(); if(isKD(A,B,C)){ System.out.println("INF"); }else{ int ans = 0; int max = Math.max(Math.max(A, B),C); for(int i=1;i<=max;i++){ if(isKD(A%i,B%i,C%i)){ ans++; } } System.out.println(ans); } } private static boolean isKD(int a, int b, int c) { if(a==b||b==c||c==a){ return false; } int min = Math.min(Math.min(a, b),c); int max = Math.max(Math.max(a, b),c); if(b==min||b==max){ return true; } return false; } } class FastScanner { private final java.io.InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } 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 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() { 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 (int) (minus ? -n : n); }else{ throw new NumberFormatException(); } b = readByte(); } } }