#164542 (Java21) No.500 階乗電卓

• 問題: No.500 階乗電卓
• ユーザー: hiromi_ayase
• 提出日時: 2017-04-07 23:05:41
• 言語: Java21 (openjdk 21)
• 結果: WA
• 実行時間: -
• コード長: 3,294 bytes
• コンパイル時間: 2,456 ms
• コンパイル使用メモリ: 78,032 KB
• 実行使用メモリ: 50,284 KB
• 最終ジャッジ日時: 2024-07-16 02:54:15
• 合計ジャッジ時間: 3,879 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	50 ms; 49,824 KB
testcase_01	AC	51 ms; 50,076 KB
testcase_02	AC	51 ms; 49,872 KB
testcase_03	AC	52 ms; 50,284 KB
testcase_04	AC	51 ms; 49,904 KB
testcase_05	AC	51 ms; 50,084 KB
testcase_06	AC	51 ms; 50,140 KB
testcase_07	AC	49 ms; 49,912 KB
testcase_08	AC	50 ms; 50,096 KB
testcase_09	AC	50 ms; 50,196 KB
testcase_10	AC	49 ms; 50,228 KB
testcase_11	AC	51 ms; 50,104 KB
testcase_12	AC	51 ms; 49,888 KB
testcase_13	WA	-
testcase_14	WA	-
testcase_15	AC	50 ms; 50,168 KB
testcase_16	AC	53 ms; 50,124 KB
testcase_17	AC	51 ms; 50,048 KB
testcase_18	AC	51 ms; 50,092 KB
testcase_19	AC	49 ms; 50,200 KB
testcase_20	AC	51 ms; 49,968 KB
testcase_21	AC	52 ms; 49,928 KB
testcase_22	AC	52 ms; 50,168 KB

ソースコード

import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;


public class Main {
  public static void main(String[] args) {
    FastScanner sc = new FastScanner();
    long N = sc.nextLong();
    long mod = 999999999999L + 1L;

    if (N > 1000000) {
      System.out.println("000000000000");
    } else {
      long ret = 1;
      for (int i = 1; i <= N; i++) {
        ret *= i;
        ret %= mod;
      }
      if (ret == 0) {
        System.out.println("000000000000");

      } else
        System.out.println(ret);

    }

  }

}


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