結果

問題 No.665 Bernoulli Bernoulli
ユーザー hiromi_ayasehiromi_ayase
提出日時 2018-03-25 00:59:27
言語 Java21
(openjdk 21)
結果
AC  
実行時間 771 ms / 2,000 ms
コード長 4,197 bytes
コンパイル時間 2,777 ms
コンパイル使用メモリ 83,348 KB
実行使用メモリ 53,792 KB
最終ジャッジ日時 2023-09-07 09:06:08
合計ジャッジ時間 15,746 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 71 ms
50,800 KB
testcase_01 AC 69 ms
51,072 KB
testcase_02 AC 765 ms
53,292 KB
testcase_03 AC 771 ms
53,632 KB
testcase_04 AC 630 ms
53,428 KB
testcase_05 AC 596 ms
53,264 KB
testcase_06 AC 595 ms
53,392 KB
testcase_07 AC 586 ms
53,448 KB
testcase_08 AC 579 ms
51,712 KB
testcase_09 AC 644 ms
53,424 KB
testcase_10 AC 580 ms
53,480 KB
testcase_11 AC 657 ms
53,528 KB
testcase_12 AC 635 ms
53,792 KB
testcase_13 AC 666 ms
53,476 KB
testcase_14 AC 683 ms
53,572 KB
testcase_15 AC 588 ms
53,508 KB
testcase_16 AC 623 ms
53,488 KB
testcase_17 AC 593 ms
53,312 KB
testcase_18 AC 580 ms
53,748 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

public class Main {
  private static void solve() {
    long n = nl();
    int k = ni();
    int mod = 1000000000 + 7;

    System.out.println(powerSums(n, k, mod)[k]);
    
  }
  public static int[] enumInvs(int n, int mod)
  {
      int[] inv = new int[n+1];
      inv[1] = 1;
      for(int i = 2;i <= n;i++){
          inv[i] = (int)(inv[mod%i]*(long)(mod-mod/i)%mod);
      }
      return inv;
  }
  public static long[] powerSums(long n, int K, int mod)
  {
      int[] invs = enumInvs(K+1, mod);
      final long BIG = 1L*mod*mod;
      n %= mod;
      long[] s = new long[K+1];
      long[] c = new long[K+2];
      c[0] = 1;
      for(int i = 0;i <= K;i++){
          for(int j = i+1;j >= 1;j--){
              c[j] += c[j-1];
              if(c[j] >= mod)c[j] -= mod;
          }
          
          s[i] = pow(n+1, i+1, mod)-1;
          for(int j = 0;j <= i-1;j++){
              s[i] -= s[j]*c[j];
              if(s[i] < -BIG)s[i] += BIG;
          }
          s[i] %= mod;
          if(s[i] < 0)s[i] += mod;
          
          s[i] = s[i] * invs[i+1] % mod;
      }
      return s;
  }
  public static long pow(long a, long n, long mod)
  {
      if(a >= mod)a %= mod;
      long ret = 1;
      int x = 63-Long.numberOfLeadingZeros(n);
      for(;x >= 0;x--){
          ret = mul(ret, ret, mod);
          if(n<<~x<0)ret = mul(ret, a, mod);
      }
      return ret;
  }
  public static long mul(long a, long b, long mod)
  {
      if(a >= mod || a < 0)a %= mod;
      if(a < 0)a += mod;
      if(b >= mod || b < 0)b %= mod;
      if(b < 0)b += mod;
      
      long ret = 0;
      int x = 63-Long.numberOfLeadingZeros(b);
      for(;x >= 0;x--){
          ret += ret;
          if(ret >= mod)ret -= mod;
          if(b<<~x<0){
              ret += a;
              if(ret >= mod)ret -= mod;
          }
      }
      return ret;
  }
  
  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));
  }
}
0