結果

問題 No.502 階乗を計算するだけ
ユーザー hiromi_ayasehiromi_ayase
提出日時 2017-04-08 15:21:49
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 4,351 bytes
コンパイル時間 2,170 ms
コンパイル使用メモリ 79,336 KB
実行使用メモリ 52,232 KB
最終ジャッジ日時 2024-07-17 23:46:42
合計ジャッジ時間 9,938 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
42,360 KB
testcase_01 AC 47 ms
36,224 KB
testcase_02 AC 48 ms
36,704 KB
testcase_03 AC 51 ms
36,980 KB
testcase_04 AC 49 ms
36,620 KB
testcase_05 AC 48 ms
36,672 KB
testcase_06 AC 47 ms
36,600 KB
testcase_07 AC 47 ms
36,980 KB
testcase_08 AC 47 ms
36,780 KB
testcase_09 AC 47 ms
36,672 KB
testcase_10 AC 48 ms
36,716 KB
testcase_11 AC 48 ms
36,684 KB
testcase_12 AC 50 ms
36,716 KB
testcase_13 AC 49 ms
36,808 KB
testcase_14 AC 48 ms
36,908 KB
testcase_15 AC 49 ms
36,672 KB
testcase_16 AC 49 ms
36,680 KB
testcase_17 AC 51 ms
36,632 KB
testcase_18 AC 50 ms
36,304 KB
testcase_19 AC 48 ms
36,808 KB
testcase_20 AC 48 ms
36,980 KB
testcase_21 AC 50 ms
36,672 KB
testcase_22 AC 76 ms
37,348 KB
testcase_23 AC 55 ms
36,584 KB
testcase_24 AC 58 ms
36,680 KB
testcase_25 AC 53 ms
36,660 KB
testcase_26 AC 53 ms
36,908 KB
testcase_27 AC 53 ms
36,908 KB
testcase_28 AC 53 ms
37,412 KB
testcase_29 AC 50 ms
36,788 KB
testcase_30 AC 62 ms
37,676 KB
testcase_31 AC 56 ms
36,916 KB
testcase_32 TLE -
testcase_33 AC 468 ms
38,156 KB
testcase_34 TLE -
testcase_35 AC 992 ms
51,324 KB
testcase_36 TLE -
testcase_37 TLE -
testcase_38 AC 211 ms
51,652 KB
testcase_39 AC 866 ms
51,160 KB
testcase_40 AC 513 ms
51,736 KB
testcase_41 AC 49 ms
50,308 KB
testcase_42 AC 49 ms
50,336 KB
testcase_43 AC 47 ms
52,232 KB
testcase_44 AC 49 ms
50,244 KB
testcase_45 AC 47 ms
50,204 KB
testcase_46 AC 47 ms
50,072 KB
testcase_47 AC 46 ms
50,224 KB
testcase_48 AC 47 ms
50,180 KB
testcase_49 AC 47 ms
50,204 KB
testcase_50 AC 47 ms
50,156 KB
testcase_51 AC 50 ms
50,032 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.NoSuchElementException;


public class Main {
  private static long pow_mod(long b, long e, long mod) {
    long ret = 1;
    for (; e > 0; e >>= 1, b = b * b % mod) {
      if ((e & 1) == 1)
        ret = ret * b % mod;
    }
    return ret;
  }

  private static long fact_valuation(long n, long p) {
    long ret = n /= p;
    while (n >= p) {
      n /= p;
      ret += n;
    }
    return ret;
  }

  private static int[] d = {6, 4, 2, 4, 2, 4, 6, 2};

  private static long fact_mod(long n, long p) {
    if (n >= p)
      return 0;
    if (n * 2 > p) {
      long ret = fact_mod(p - n - 1, p);
      ret = ((p - n - 1) & 1) == 1 ? ret : p - ret;
      return pow_mod(ret, p - 2, p);
    }
    List<Long> ns = new ArrayList<>();
    for (long i = n; i > 1; i /= 5)
      for (long j = i; j > 1; j /= 3)
        for (long k = j; k > 1; k >>= 1)
          ns.add(k);

    Collections.sort(ns);


    long ret = 1, prod = 1, i = 1, r = 0;
    for (long end : ns) {
      for (; i <= end; i += d[(int) (r & 7)], ++r) {
        prod = prod * i % p;
      }
      ret = ret * prod % p;
    }
    ret = ret * pow_mod(2, fact_valuation(n, 2L), p) % p;
    ret = ret * pow_mod(3, fact_valuation(n, 3L), p) % p;
    ret = ret * pow_mod(5, fact_valuation(n, 5L), p) % p;
    return ret;
  }

  public static void main(String[] args) {
    FastScanner sc = new FastScanner();

    long mod = 1000000000 + 7;
    long N = sc.nextLong();
    System.out.println(fact_mod(N, mod));
  }
}


class FastScanner {
  public static String debug = null;

  private final InputStream in = System.in;
  private int ptr = 0;
  private int buflen = 0;
  private byte[] buffer = new byte[1024];
  private boolean eos = false;

  private boolean hasNextByte() {
    if (ptr < buflen) {
      return true;
    } else {
      ptr = 0;
      try {
        if (debug != null) {
          buflen = debug.length();
          buffer = debug.getBytes();
          debug = "";
          eos = true;
        } else {
          buflen = in.read(buffer);
        }
      } catch (IOException e) {
        e.printStackTrace();
      }
      if (buflen < 0) {
        eos = true;
        return false;
      } else if (buflen == 0) {
        return false;
      }
    }
    return true;
  }

  private int readByte() {
    if (hasNextByte())
      return buffer[ptr++];
    else
      return -1;
  }

  private static boolean isPrintableChar(int c) {
    return 33 <= c && c <= 126;
  }

  private void skipUnprintable() {
    while (hasNextByte() && !isPrintableChar(buffer[ptr]))
      ptr++;
  }

  public boolean isEOS() {
    return this.eos;
  }

  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();
  }

  public long[] nextLongList(int n) {
    return nextLongTable(1, n)[0];
  }

  public int[] nextIntList(int n) {
    return nextIntTable(1, n)[0];
  }

  public long[][] nextLongTable(int n, int m) {
    long[][] ret = new long[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        ret[i][j] = nextLong();
      }
    }
    return ret;
  }

  public int[][] nextIntTable(int n, int m) {
    int[][] ret = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        ret[i][j] = nextInt();
      }
    }
    return ret;
  }
}
0