結果

問題 No.502 階乗を計算するだけ
ユーザー zimpha
提出日時 2017-04-08 02:40:15
言語 Java
(openjdk 23)
結果
AC  
実行時間 226 ms / 1,000 ms
コード長 4,756 bytes
コンパイル時間 1,993 ms
コンパイル使用メモリ 77,820 KB
実行使用メモリ 51,284 KB
最終ジャッジ日時 2024-07-16 03:50:45
合計ジャッジ時間 7,185 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 52
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Chiaki.Hoshinomori
 */
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);
        Task502 solver = new Task502();
        solver.solve(1, in, out);
        out.close();
    }

    static class Task502 {
        int[] fact = new int[]{
                1,
                682498929,
                491101308,
                76479948,
                723816384,
                67347853,
                27368307,
                625544428,
                199888908,
                888050723,
                927880474,
                281863274,
                661224977,
                623534362,
                970055531,
                261384175,
                195888993,
                66404266,
                547665832,
                109838563,
                933245637,
                724691727,
                368925948,
                268838846,
                136026497,
                112390913,
                135498044,
                217544623,
                419363534,
                500780548,
                668123525,
                128487469,
                30977140,
                522049725,
                309058615,
                386027524,
                189239124,
                148528617,
                940567523,
                917084264,
                429277690,
                996164327,
                358655417,
                568392357,
                780072518,
                462639908,
                275105629,
                909210595,
                99199382,
                703397904,
                733333339,
                97830135,
                608823837,
                256141983,
                141827977,
                696628828,
                637939935,
                811575797,
                848924691,
                131772368,
                724464507,
                272814771,
                326159309,
                456152084,
                903466878,
                92255682,
                769795511,
                373745190,
                606241871,
                825871994,
                957939114,
                435887178,
                852304035,
                663307737,
                375297772,
                217598709,
                624148346,
                671734977,
                624500515,
                748510389,
                203191898,
                423951674,
                629786193,
                672850561,
                814362881,
                823845496,
                116667533,
                256473217,
                627655552,
                245795606,
                586445753,
                172114298,
                193781724,
                778983779,
                83868974,
                315103615,
                965785236,
                492741665,
                377329025,
                847549272,
                698611116,
        };

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            long n = in.nextLong();
            long mod = 1000000000 + 7;
            if (n >= mod) {
                out.println(0);
            } else {
                long r = fact[(int) (n / 10000000)];
                for (long i = n / 10000000 * 10000000 + 1; i <= n; ++i) {
                    r = r * i % mod;
                }
                out.println(r);
            }
        }

    }

    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 long nextLong() {
            return Long.parseLong(next());
        }

    }
}
0