結果
問題 | No.250 atetubouのzetubou |
ユーザー | 37zigen |
提出日時 | 2020-03-19 16:31:17 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 296 ms / 5,000 ms |
コード長 | 2,724 bytes |
コンパイル時間 | 2,484 ms |
コンパイル使用メモリ | 78,232 KB |
実行使用メモリ | 42,860 KB |
最終ジャッジ日時 | 2024-12-14 03:17:46 |
合計ジャッジ時間 | 7,377 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 20 |
ソースコード
import java.io.FileNotFoundException; import java.io.IOException; import java.io.InputStream; import java.math.BigInteger; import java.util.Arrays; import java.util.NoSuchElementException; public class Main { public static void main(String[] args) throws FileNotFoundException { long t = System.currentTimeMillis(); new Main().run(); System.err.println(System.currentTimeMillis() - t); } long gcd(long a,long b) { return a==0?b:gcd(b%a,a); } void run() { Scanner sc = new Scanner(); int Q=sc.nextInt(); for(int q=0;q<Q;++q) { int D=sc.nextInt(); int X=sc.nextInt(); long T=sc.nextLong(); //(X+D-1)!/X!/(D-1)!<=T //(X+D-1)(X+D-2)...(X+1) //--------------------- <= T //(D - 1)(D - 2)...( 1 ) boolean ok=true; long cur=1; for(int i=1;i<=D-1;++i) { cur=cur*(X+i)/i; if(cur>T) { ok=false; break; } } if(cur>T)ok=false; System.out.println(ok?"AC":"ZETUBOU"); } } class Scanner { private final 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 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() { return (int) nextLong(); } } static void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } }