結果

問題 No.500 階乗電卓
ユーザー hiromi_ayasehiromi_ayase
提出日時 2017-04-07 23:11:54
言語 Java11
(openjdk 11.0.7)
結果
WA   .
(最新)
AC  
(最初)
実行時間 -
コード長 3,472 Byte
コンパイル時間 2,309 ms
使用メモリ 41,328 KB
最終ジャッジ日時 2020-06-13 13:59:35

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 78 ms
34,192 KB
testcase_01 AC 79 ms
34,148 KB
testcase_02 AC 82 ms
34,276 KB
testcase_03 AC 85 ms
36,132 KB
testcase_04 AC 78 ms
34,160 KB
testcase_05 AC 77 ms
34,164 KB
testcase_06 WA -
testcase_07 AC 75 ms
34,164 KB
testcase_08 AC 77 ms
34,164 KB
testcase_09 AC 81 ms
34,196 KB
testcase_10 AC 82 ms
34,144 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 80 ms
34,168 KB
testcase_17 AC 78 ms
34,152 KB
testcase_18 AC 78 ms
34,164 KB
testcase_19 AC 85 ms
34,192 KB
testcase_20 AC 79 ms
38,336 KB
testcase_21 AC 80 ms
34,164 KB
testcase_22 AC 78 ms
34,148 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
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;
      boolean flg = false;
      for (int i = 1; i <= N; i++) {
        ret *= i;
        if (ret > mod) {
          flg = true;
          ret %= mod;
        }
      }
      if (ret == 0) {
        System.out.println("000000000000");

      } else if (flg) {
        System.out.println(String.format("%012d\n", ret));
      } 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;
  }
}
0