結果

問題 No.573 a^2[i] = a[i]
ユーザー yuya178yuya178
提出日時 2017-10-09 17:55:20
言語 Java21
(openjdk 21)
結果
AC  
実行時間 139 ms / 2,000 ms
コード長 5,292 bytes
コンパイル時間 2,049 ms
コンパイル使用メモリ 81,488 KB
実行使用メモリ 56,652 KB
最終ジャッジ日時 2023-08-10 21:14:58
合計ジャッジ時間 9,067 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 97 ms
56,232 KB
testcase_01 AC 93 ms
56,628 KB
testcase_02 AC 94 ms
56,180 KB
testcase_03 AC 99 ms
56,340 KB
testcase_04 AC 96 ms
56,312 KB
testcase_05 AC 95 ms
56,180 KB
testcase_06 AC 94 ms
56,616 KB
testcase_07 AC 98 ms
56,652 KB
testcase_08 AC 99 ms
56,184 KB
testcase_09 AC 93 ms
56,356 KB
testcase_10 AC 92 ms
56,536 KB
testcase_11 AC 94 ms
56,452 KB
testcase_12 AC 96 ms
56,284 KB
testcase_13 AC 94 ms
56,428 KB
testcase_14 AC 93 ms
56,212 KB
testcase_15 AC 96 ms
56,424 KB
testcase_16 AC 93 ms
56,436 KB
testcase_17 AC 94 ms
56,208 KB
testcase_18 AC 94 ms
56,444 KB
testcase_19 AC 96 ms
56,352 KB
testcase_20 AC 94 ms
56,444 KB
testcase_21 AC 93 ms
56,184 KB
testcase_22 AC 94 ms
56,508 KB
testcase_23 AC 91 ms
56,504 KB
testcase_24 AC 93 ms
56,212 KB
testcase_25 AC 101 ms
56,384 KB
testcase_26 AC 91 ms
56,384 KB
testcase_27 AC 92 ms
56,368 KB
testcase_28 AC 93 ms
54,156 KB
testcase_29 AC 95 ms
56,176 KB
testcase_30 AC 99 ms
54,632 KB
testcase_31 AC 95 ms
56,392 KB
testcase_32 AC 96 ms
56,492 KB
testcase_33 AC 92 ms
56,436 KB
testcase_34 AC 98 ms
56,384 KB
testcase_35 AC 90 ms
54,364 KB
testcase_36 AC 89 ms
56,168 KB
testcase_37 AC 93 ms
56,512 KB
testcase_38 AC 95 ms
56,336 KB
testcase_39 AC 96 ms
56,264 KB
testcase_40 AC 97 ms
56,344 KB
testcase_41 AC 92 ms
56,380 KB
testcase_42 AC 98 ms
56,160 KB
testcase_43 AC 104 ms
56,340 KB
testcase_44 AC 95 ms
56,360 KB
testcase_45 AC 95 ms
56,180 KB
testcase_46 AC 139 ms
56,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;

public class Main {
    static InputStream is;
    static PrintWriter out;
    static String INPUT = "";

    static long MODULO = 1_000_000_000 + 7;
    static long[] fac = new long[200000];
    static long[] invfac = new long[200000];
    static long[] inv = new long[200000];
    
    static void solve()
    {
        int n = ni();

        fac[0] = 1;
        for (int i = 1; i < fac.length; ++i)
            fac[i] = i * fac[i - 1] % MODULO;
        inv[1] = 1;
        for (int i = 2; i < inv.length; ++i) {
            inv[i] = (MODULO - MODULO / i * inv[(int) MODULO % i] % MODULO) % MODULO;
        }
        invfac[0] = 1;
        for (int i = 1; i < invfac.length; ++i)
            invfac[i] = inv[i] * invfac[i - 1] % MODULO;

        long ans = 0;
        for(int i = 0; i <= n; i++){
            ans += C(n, i) * pow(i, n-i) % MODULO;
            ans %= MODULO;
        }
        out.println(ans);

    }


    public static void main(String[] args) throws Exception
    {
        long S = System.currentTimeMillis();
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        solve();
        out.flush();
        long G = System.currentTimeMillis();
        tr(G-S+"ms");
    }

    private static long C(int n, int k) {
        return fac[n] * invfac[k] % MODULO * invfac[n - k] % MODULO;
    }

    public static long pow(long a, long n) {
        long ret = 1;
        for (; n > 0; n >>= 1, a = a * a % MODULO) {
            if (n % 2 == 1)
                ret = ret * a % MODULO;
        }
        return ret;
    }

    
    private static boolean eof()
    {
        if(lenbuf == -1)return true;
        int lptr = ptrbuf;
        while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
        
        try {
            is.mark(1000);
            while(true){
                int b = is.read();
                if(b == -1){
                    is.reset();
                    return true;
                }else if(!isSpaceChar(b)){
                    is.reset();
                    return false;
                }
            }
        } catch (IOException e) {
            return true;
        }
    }
    
    private static byte[] inbuf = new byte[1024];
    static int lenbuf = 0, ptrbuf = 0;
    
    private static int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
//  private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }
    private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private static double nd() { return Double.parseDouble(ns()); }
    private static char nc() { return (char)skip(); }
    
    private static String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b))){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private static char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private static char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private static int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private static int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }

    private static int[] nsi(){
        char[] s = ns().toCharArray();
        int[] a = new int[s.length];
        for(int j = 0; j < s.length; j++){
           a[j] = s[j] - '0';
        }
        return a;
    }
}
0