結果
問題 | No.500 階乗電卓 |
ユーザー |
![]() |
提出日時 | 2017-06-19 19:52:32 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 130 ms / 2,000 ms |
コード長 | 2,261 bytes |
コンパイル時間 | 2,457 ms |
コンパイル使用メモリ | 79,420 KB |
実行使用メモリ | 41,380 KB |
最終ジャッジ日時 | 2024-06-25 03:02:34 |
合計ジャッジ時間 | 5,885 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 20 |
ソースコード
import java.io.ByteArrayInputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.Arrays;import java.util.InputMismatchException;import java.io.OutputStream;import java.util.StringTokenizer;import java.io.BufferedReader;import java.io.InputStreamReader;/*** Built using CHelper plug-in* Actual solution is at the top*/public class Main {public static void main(String[] args) {InputStream inputStream = System.in;OutputStream outputStream = System.out;InputReader in = new InputReader(inputStream);PrintWriter out = new PrintWriter(outputStream);Task solver = new Task();solver.solve(1, in, out);out.close();}static class Task {public void solve(int testNumber, InputReader in, PrintWriter out) {long N = in.nextLong();long res = 1L;long div = 1000000000000L;long keta = 1L;for(int i=1; i<=N; i++){keta = keta*i;if(keta>=1000000000000L){keta=0;}res = (res*i)%div;if(res==0) break;}int ketaLen = String.valueOf(keta).length();if(keta==0) ketaLen=12;out.printf(String.format("%%0%dd",ketaLen),res);out.println();}}static class InputReader {public BufferedReader reader;public StringTokenizer tokenizer;public InputReader(InputStream stream) {reader = new BufferedReader(new InputStreamReader(stream), 32768);tokenizer = null;}public String next() {while (tokenizer == null || !tokenizer.hasMoreTokens()) {try {tokenizer = new StringTokenizer(reader.readLine());} catch (IOException e) {throw new RuntimeException(e);}}return tokenizer.nextToken();}public int nextInt() {return Integer.parseInt(next());}public long nextLong() {return Long.parseLong(next());}}}