結果

問題 No.573 a^2[i] = a[i]
ユーザー tancahn2380tancahn2380
提出日時 2018-03-31 19:18:34
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 67 ms / 2,000 ms
コード長 2,246 bytes
コンパイル時間 808 ms
コンパイル使用メモリ 100,200 KB
実行使用メモリ 13,008 KB
最終ジャッジ日時 2023-09-08 10:16:50
合計ジャッジ時間 4,590 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
12,868 KB
testcase_01 AC 26 ms
12,728 KB
testcase_02 AC 26 ms
12,716 KB
testcase_03 AC 26 ms
12,728 KB
testcase_04 AC 26 ms
12,836 KB
testcase_05 AC 26 ms
12,732 KB
testcase_06 AC 26 ms
12,644 KB
testcase_07 AC 26 ms
12,804 KB
testcase_08 AC 26 ms
12,872 KB
testcase_09 AC 27 ms
12,944 KB
testcase_10 AC 27 ms
12,812 KB
testcase_11 AC 26 ms
12,720 KB
testcase_12 AC 26 ms
12,976 KB
testcase_13 AC 26 ms
12,744 KB
testcase_14 AC 26 ms
12,720 KB
testcase_15 AC 26 ms
12,908 KB
testcase_16 AC 26 ms
12,648 KB
testcase_17 AC 27 ms
12,740 KB
testcase_18 AC 26 ms
13,000 KB
testcase_19 AC 26 ms
12,700 KB
testcase_20 AC 26 ms
12,660 KB
testcase_21 AC 26 ms
12,740 KB
testcase_22 AC 26 ms
12,708 KB
testcase_23 AC 26 ms
12,868 KB
testcase_24 AC 26 ms
12,852 KB
testcase_25 AC 27 ms
12,732 KB
testcase_26 AC 26 ms
12,796 KB
testcase_27 AC 26 ms
13,000 KB
testcase_28 AC 27 ms
12,864 KB
testcase_29 AC 26 ms
13,004 KB
testcase_30 AC 26 ms
12,744 KB
testcase_31 AC 26 ms
12,660 KB
testcase_32 AC 26 ms
12,788 KB
testcase_33 AC 27 ms
12,808 KB
testcase_34 AC 26 ms
12,736 KB
testcase_35 AC 27 ms
12,780 KB
testcase_36 AC 27 ms
12,728 KB
testcase_37 AC 27 ms
13,008 KB
testcase_38 AC 26 ms
12,744 KB
testcase_39 AC 26 ms
12,852 KB
testcase_40 AC 27 ms
12,784 KB
testcase_41 AC 27 ms
12,720 KB
testcase_42 AC 27 ms
13,004 KB
testcase_43 AC 27 ms
12,700 KB
testcase_44 AC 27 ms
12,736 KB
testcase_45 AC 30 ms
12,668 KB
testcase_46 AC 67 ms
12,664 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <tuple>
# include <unordered_map>
# include <numeric>
# include <complex>
# include <bitset>
# include <random>
# include <chrono>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr int INF = 2147483647;
constexpr int HINF = INF / 2;
constexpr double DINF = 100000000000000000.0;
constexpr double HDINF = 50000000000000000.0;
constexpr long long LINF = 9223372036854775807;
constexpr long long HLINF = 4500000000000000000;
const double PI = acos(-1);
int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
# define ALL(x)      (x).begin(),(x).end()
# define UNIQ(c)     (c).erase(unique(ALL((c))),(c).end())
# define LOWER(s)    transform(ALL((s)),(s).begin(),TL<char>)
# define UPPER(s)    transform(ALL((s)),(s).begin(),TU<char>)
# define mp          make_pair
# define eb          emplace_back
# define FOR(i,a,b)  for(LL i=(a);i<(b);i++)
# define RFOR(i,a,b) for(LL i=(a);i>=(b);i--)
# define REP(i,n)    FOR(i,0,n)
# define INIT        std::ios::sync_with_stdio(false);std::cin.tie(0)

LL MOD = 1000000007;
LL combi(LL N_, LL C_) {
	const int NUM_ = 400001;
	static LL fact[NUM_ + 1], factr[NUM_ + 1], inv[NUM_ + 1];
	if (fact[0] == 0) {
		inv[1] = fact[0] = factr[0] = 1;
		for (int i = 2; i <= NUM_; ++i) inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
		for (int i = 1; i <= NUM_; ++i) fact[i] = fact[i - 1] * i%MOD, factr[i] = factr[i - 1] * inv[i] % MOD;
	}
	if (C_<0 || C_>N_) return 0;
	return factr[C_] * fact[N_] % MOD*factr[N_ - C_] % MOD;
}
LL hcomb(int P_, int Q_) { return (P_ == 0 && Q_ == 0) ? 1 : combi(P_ + Q_ - 1, Q_); }

LL modpow(LL a, LL n = MOD - 2) {
	LL r = 1;
	while (n) r = r*((n % 2) ? a : 1) % MOD, a = a*a%MOD, n >>= 1;
	return r;
}


int main() {
	int n;
	cin >> n;
	LL ans = 0;
	for (int i = 1; i <= n; i++) {
		ans += combi(n, i)*modpow(i, n - i)%MOD;
	}
	cout << ans%MOD << endl;
}
0