結果
問題 | No.391 CODING WAR |
ユーザー | uwi |
提出日時 | 2016-07-08 22:25:25 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 195 ms / 2,000 ms |
コード長 | 4,073 bytes |
コンパイル時間 | 3,533 ms |
コンパイル使用メモリ | 85,436 KB |
実行使用メモリ | 45,888 KB |
最終ジャッジ日時 | 2024-10-13 04:22:33 |
合計ジャッジ時間 | 6,926 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 99 ms
45,820 KB |
testcase_01 | AC | 97 ms
45,832 KB |
testcase_02 | AC | 100 ms
45,692 KB |
testcase_03 | AC | 99 ms
45,368 KB |
testcase_04 | AC | 100 ms
45,564 KB |
testcase_05 | AC | 96 ms
45,692 KB |
testcase_06 | AC | 97 ms
45,820 KB |
testcase_07 | AC | 100 ms
45,416 KB |
testcase_08 | AC | 96 ms
45,404 KB |
testcase_09 | AC | 195 ms
45,516 KB |
testcase_10 | AC | 177 ms
45,632 KB |
testcase_11 | AC | 152 ms
45,888 KB |
testcase_12 | AC | 95 ms
45,504 KB |
testcase_13 | AC | 185 ms
45,556 KB |
testcase_14 | AC | 177 ms
45,736 KB |
testcase_15 | AC | 181 ms
45,516 KB |
testcase_16 | AC | 153 ms
45,468 KB |
testcase_17 | AC | 157 ms
45,828 KB |
testcase_18 | AC | 139 ms
45,500 KB |
testcase_19 | AC | 138 ms
45,512 KB |
ソースコード
package contest; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class N391 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int mod = 1000000007; long n = nl(); int m = ni(); int[][] fif = enumFIF(1000000, mod); long ret = 0; int sig = 1; for(int i = m;i >= 1;i--){ ret += sig * pow(i, n, mod) * C(m, i, mod, fif); ret %= mod; sig = -sig; } ret %= mod; if(ret < 0)ret += mod; out.println(ret); } public static long C(int n, int r, int mod, int[][] fif) { if (n < 0 || r < 0 || r > n) return 0; return (long) fif[0][n] * fif[1][r] % mod * fif[1][n - r] % mod; } 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 a, long n, long mod) { // a %= mod; long ret = 1; int x = 63 - Long.numberOfLeadingZeros(n); for (; x >= 0; x--) { ret = ret * ret % mod; if (n << 63 - x < 0) ret = ret * a % mod; } return ret; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new N391().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }