結果

問題 No.797 Noelちゃんとピラミッド
ユーザー OlandOland
提出日時 2019-05-24 17:34:41
言語 Java19
(openjdk 21)
結果
AC  
実行時間 154 ms / 2,000 ms
コード長 4,745 bytes
コンパイル時間 2,238 ms
コンパイル使用メモリ 78,068 KB
実行使用メモリ 64,736 KB
最終ジャッジ日時 2023-10-17 11:59:23
合計ジャッジ時間 15,606 ms
ジャッジサーバーID
(参考情報)
judge13 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 106 ms
63,060 KB
testcase_01 AC 109 ms
63,060 KB
testcase_02 AC 109 ms
63,044 KB
testcase_03 AC 153 ms
64,692 KB
testcase_04 AC 150 ms
64,664 KB
testcase_05 AC 150 ms
64,728 KB
testcase_06 AC 149 ms
64,732 KB
testcase_07 AC 153 ms
64,696 KB
testcase_08 AC 152 ms
64,708 KB
testcase_09 AC 149 ms
64,296 KB
testcase_10 AC 149 ms
64,660 KB
testcase_11 AC 151 ms
64,188 KB
testcase_12 AC 154 ms
64,724 KB
testcase_13 AC 150 ms
64,728 KB
testcase_14 AC 148 ms
64,720 KB
testcase_15 AC 149 ms
64,728 KB
testcase_16 AC 151 ms
64,736 KB
testcase_17 AC 153 ms
64,292 KB
testcase_18 AC 151 ms
64,724 KB
testcase_19 AC 150 ms
64,692 KB
testcase_20 AC 150 ms
62,248 KB
testcase_21 AC 150 ms
64,188 KB
testcase_22 AC 151 ms
64,736 KB
testcase_23 AC 146 ms
64,728 KB
testcase_24 AC 134 ms
64,188 KB
testcase_25 AC 142 ms
64,700 KB
testcase_26 AC 142 ms
64,700 KB
testcase_27 AC 151 ms
64,720 KB
testcase_28 AC 150 ms
64,308 KB
testcase_29 AC 135 ms
64,152 KB
testcase_30 AC 134 ms
64,168 KB
testcase_31 AC 146 ms
64,712 KB
testcase_32 AC 138 ms
64,168 KB
testcase_33 AC 145 ms
64,728 KB
testcase_34 AC 143 ms
64,724 KB
testcase_35 AC 149 ms
64,728 KB
testcase_36 AC 133 ms
64,168 KB
testcase_37 AC 149 ms
64,728 KB
testcase_38 AC 148 ms
64,728 KB
testcase_39 AC 144 ms
64,704 KB
testcase_40 AC 132 ms
64,168 KB
testcase_41 AC 133 ms
64,156 KB
testcase_42 AC 144 ms
64,292 KB
testcase_43 AC 108 ms
63,024 KB
testcase_44 AC 107 ms
63,064 KB
testcase_45 AC 106 ms
61,144 KB
testcase_46 AC 107 ms
63,048 KB
testcase_47 AC 111 ms
63,064 KB
testcase_48 AC 109 ms
63,048 KB
testcase_49 AC 108 ms
63,064 KB
testcase_50 AC 108 ms
63,048 KB
testcase_51 AC 108 ms
63,052 KB
testcase_52 AC 105 ms
63,048 KB
testcase_53 AC 109 ms
63,036 KB
testcase_54 AC 109 ms
63,032 KB
testcase_55 AC 108 ms
63,052 KB
testcase_56 AC 108 ms
63,076 KB
testcase_57 AC 106 ms
63,016 KB
testcase_58 AC 107 ms
63,044 KB
testcase_59 AC 107 ms
63,048 KB
testcase_60 AC 105 ms
63,048 KB
testcase_61 AC 107 ms
63,020 KB
testcase_62 AC 107 ms
63,060 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.io.*;
import java.util.*;
import java.util.Map.Entry;

@SuppressWarnings("unused")
public class Main {
	
	//final boolean isDebug = true;
	final boolean isDebug = false;
	String fileName = "input.txt";
	FastScanner sc;
	PrintWriter out;
	final int MOD = (int)1e9+7;
	//final int INF = Integer.MAX_VALUE / 2;
	final long INF = Long.MAX_VALUE / 2;
	
	void solve() throws Exception{
		int N = sc.nextInt();
		long ans = 0;
		CombCalculator cc = new CombCalculator();
		for(int i = 0; i < N; i++){
			int a = sc.nextInt();
			ans = (ans + (a * cc.modComb(N-1, i) % MOD)) % MOD;
		}
		System.out.println(ans);
 	}
	
	/* end solve */
	
	/* main */
	public static void main(String[] args) throws Exception {
		new Main().m();
	}
	
	void m() throws Exception {
		long S = System.currentTimeMillis();
		sc = (isDebug) ? new FastScanner(new FileInputStream(fileName)) : new FastScanner(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		if(isDebug){
			System.out.println("---Debug---");
			System.out.printf("%8d ms\n", (G-S));
		}
	}
	/* end main */
}
/* end Main */

class CombCalculator{
	//引数の最大値、MOD、階乗・MODの逆元・階乗の逆元のテーブル
	static int MAX_FAC = 510000;
	static int MOD = (int)1e9+7;
	static long[] fac = new long[MAX_FAC+1];
	static long[] finv = new long[MAX_FAC+1];
	static long[] inv = new long[MAX_FAC+1];
	
	public CombCalculator(){
		this(510000, (int)1e9+7);
	}
	
	public CombCalculator(int max, int mod){
		MAX_FAC = max; MOD = mod;
		initComb();
	}
	
	//テーブルの初期化
	void initComb(){
		fac[0] = finv[0] = inv[0] = fac[1] = finv[1] = inv[1] = 1;
		for (int i = 2; i <= MAX_FAC; ++i) {
			fac[i] = fac[i - 1] * i % MOD;
			inv[i] = MOD - (MOD / i) * inv[(int) (MOD % i)] % MOD;
			finv[i] = finv[i - 1] * inv[i] % MOD;
		}
	}
	
	//nPk % MOD
	public long modPerm(int n, int k){
		return fac[n] * finv[n - k] % MOD;
	}
	
	//nCk % MOD
	public long modComb(int n, int k){
		return fac[n] * finv[k] % MOD * finv[n - k] % MOD;
	}
	
	//n! % MOD
	public long modFact(int n){
		return fac[n];
	}
	
	//(n!)^-1 % MOD
	public long modFactInv(int n){
		return finv[n];
	}
	
	//n^-1 % MOD
	public long modInv(int n){
		return inv[n];
	}
}

class FastScanner {
    private InputStream in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    public FastScanner(InputStream in) {
		this.in = in;
	}
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            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;
    }
    public boolean hasNext() {
    	while(hasNextByte() && !isPrintableChar(buffer[ptr]))
    		ptr++; 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 String nextLine() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(b != 10) {
            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() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() {
    	return Double.parseDouble(next());
    }
}
0