結果
問題 | No.1809 Divide NCK |
ユーザー | nishi5451 |
提出日時 | 2022-01-27 21:38:59 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,994 bytes |
コンパイル時間 | 2,350 ms |
コンパイル使用メモリ | 81,028 KB |
実行使用メモリ | 44,356 KB |
最終ジャッジ日時 | 2024-06-07 19:06:43 |
合計ジャッジ時間 | 7,334 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 48 ms
41,784 KB |
testcase_01 | AC | 47 ms
37,060 KB |
testcase_02 | AC | 47 ms
36,792 KB |
testcase_03 | AC | 47 ms
36,924 KB |
testcase_04 | AC | 46 ms
36,880 KB |
testcase_05 | AC | 46 ms
36,888 KB |
testcase_06 | AC | 46 ms
36,908 KB |
testcase_07 | AC | 46 ms
36,636 KB |
testcase_08 | AC | 46 ms
36,768 KB |
testcase_09 | AC | 46 ms
36,768 KB |
testcase_10 | AC | 48 ms
36,620 KB |
testcase_11 | AC | 48 ms
37,016 KB |
testcase_12 | AC | 47 ms
37,052 KB |
testcase_13 | AC | 50 ms
36,880 KB |
testcase_14 | AC | 47 ms
36,812 KB |
testcase_15 | AC | 51 ms
36,876 KB |
testcase_16 | TLE | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
ソースコード
import java.util.*; import java.util.stream.*; import java.io.*; public class Main { static final int INF = 1<<30; static final long INFL = 1L<<60; static final int MOD = 1000000007; static final int MOD2 = 998244353; static List<List<Integer>> g; static long f(long n, long m){ long ret = 0; long p = m; while(n >= p){ ret += n/p; if(n/p < m) break; p *= m; } return ret; } public static void main(String[] args) { FastScanner fs = new FastScanner(); PrintWriter pw = new PrintWriter(System.out); long n = fs.nextLong(); long k = fs.nextLong(); long m = fs.nextLong(); Map<Long, Integer> fac = new HashMap<>(); long t = m; for(long i = 2; i <= t; i++){ int cnt = 0; while(t%i == 0){ t /= i; cnt++; } if(cnt > 0) fac.put(i, cnt); } if(t != 1) fac.put(t, 1); long ans = INF; for(long key : fac.keySet()){ long x = f(n, key) - f(n-k, key) - f(k, key); x /= fac.get(key); ans = Math.min(ans, x); } pw.println(ans); pw.close(); } } class FastScanner { private InputStream in = System.in; private byte[] buffer = new byte[1024]; private int length = 0, p = 0; private boolean hasNextByte() { if (p < length) return true; else{ p = 0; try{ length = in.read(buffer); }catch(Exception e){ e.printStackTrace(); } if(length == 0) return false; } return true; } private int readByte() { if (hasNextByte() == true) return buffer[p++]; return -1; } private static boolean isPrintable(int n) { return 33 <= n && n <= 126; } private void skip() { while (hasNextByte() && !isPrintable(buffer[p])) p++; } public boolean hasNext() { skip(); return hasNextByte(); } public String next() { if(!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int temp = readByte(); while (isPrintable(temp)) { sb.appendCodePoint(temp); temp = readByte(); } return sb.toString(); } public int nextInt() { return Math.toIntExact(nextLong()); } public int[] nextInts(int n) { int[] ar = new int[n]; for (int i = 0; i < n; i++) ar[i] = nextInt(); return ar; } public long[] nextLongs(int n) { long[] ar = new long[n]; for (int i = 0; i < n; i++) ar[i] = nextLong(); return ar; } public long nextLong() { if(!hasNext()) throw new NoSuchElementException(); boolean minus = false; int temp = readByte(); if (temp == '-') { minus = true; temp = readByte(); } if (temp < '0' || '9' < temp) throw new NumberFormatException(); long n = 0; while (isPrintable(temp)) { if ('0' <= temp && temp <= '9') { n *= 10; n += temp - '0'; } temp = readByte(); } return minus ? -n : n; } public char[] nextChars() { String s = next(); return s.toCharArray(); } public char[][] nextCharMat(int h, int w) { char[][] ar = new char[h][w]; for(int i = 0; i < h; i++){ String s = next(); for(int j = 0; j < w; j++){ ar[i][j] = s.charAt(j); } } return ar; } }