結果
問題 | No.2058 Binary String |
ユーザー | hiromi_ayase |
提出日時 | 2022-08-26 23:38:46 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 220 ms / 2,000 ms |
コード長 | 4,045 bytes |
コンパイル時間 | 3,451 ms |
コンパイル使用メモリ | 89,732 KB |
実行使用メモリ | 41,572 KB |
最終ジャッジ日時 | 2024-04-22 01:43:39 |
合計ジャッジ時間 | 8,008 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 80 ms
38,584 KB |
testcase_01 | AC | 79 ms
38,436 KB |
testcase_02 | AC | 154 ms
41,312 KB |
testcase_03 | AC | 81 ms
38,396 KB |
testcase_04 | AC | 80 ms
38,528 KB |
testcase_05 | AC | 80 ms
38,196 KB |
testcase_06 | AC | 95 ms
39,416 KB |
testcase_07 | AC | 204 ms
41,356 KB |
testcase_08 | AC | 110 ms
39,264 KB |
testcase_09 | AC | 213 ms
41,136 KB |
testcase_10 | AC | 136 ms
39,928 KB |
testcase_11 | AC | 117 ms
39,780 KB |
testcase_12 | AC | 169 ms
40,712 KB |
testcase_13 | AC | 139 ms
39,904 KB |
testcase_14 | AC | 125 ms
39,756 KB |
testcase_15 | AC | 127 ms
39,512 KB |
testcase_16 | AC | 130 ms
39,788 KB |
testcase_17 | AC | 138 ms
40,036 KB |
testcase_18 | AC | 94 ms
39,228 KB |
testcase_19 | AC | 212 ms
41,472 KB |
testcase_20 | AC | 194 ms
40,996 KB |
testcase_21 | AC | 213 ms
41,392 KB |
testcase_22 | AC | 211 ms
41,572 KB |
testcase_23 | AC | 218 ms
41,396 KB |
testcase_24 | AC | 217 ms
41,172 KB |
testcase_25 | AC | 220 ms
41,396 KB |
ソースコード
import java.util.*; @SuppressWarnings("unused") public class Main { private static void solve() { int n = ni(); int k = ni(); int mod = 998244353; long ret = 0; int[][] fif = enumFIF(n, mod); for (int i = 1; i < n; i++) { ret += pow(i, k, mod) * CX(n-1,i,mod,fif) % mod; ret %= mod; } System.out.println(ret); } public static long CX(long n, long r, int p, int[][] fif) { if (n < 0 || r < 0 || r > n) return 0; int np = (int) (n % p), rp = (int) (r % p); if (np < rp) return 0; if (n == 0 && r == 0) return 1; int nrp = np - rp; if (nrp < 0) nrp += p; return (long) fif[0][np] * fif[1][rp] % p * fif[1][nrp] % p * CX(n / p, r / p, p, fif) % p; } public static int[][] enumFIF(int n, int mod) { int[] f = new int[n + 1]; int[] invf = new int[n + 1]; f[0] = 1; for (int i = 1; i <= n; i++) { f[i] = (int) ((long) f[i - 1] * i % mod); } long a = f[n]; long b = mod; long p = 1, q = 0; while (b > 0) { long c = a / b; long d; d = a; a = b; b = d % b; d = p; p = q; q = d - c * q; } invf[n] = (int) (p < 0 ? p + mod : p); for (int i = n - 1; i >= 0; i--) { invf[i] = (int) ((long) invf[i + 1] * (i + 1) % mod); } return new int[][] { f, invf }; } public static long pow(long x, long n, long m) { assert (n >= 0 && m >= 1); long ans = 1; while (n > 0) { if (n % 2 == 1) ans = (ans * x) % m; x = (x * x) % m; n /= 2; } return ans; } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }