結果

問題 No.978 Fibonacci Convolution Easy
ユーザー 👑 はまやんはまやんはまやんはまやん
提出日時 2020-02-01 09:22:41
言語 C++17(1z)
(gcc 10.2.0 + boost 1.73.0)
結果
AC  
実行時間 24 ms / 2,000 ms
コード長 3,318 Byte
コンパイル時間 4,176 ms
使用メモリ 11,304 KB
最終ジャッジ日時 2021-02-20 20:42:04
合計ジャッジ時間 6,035 ms
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 6 ms
11,104 KB
testcase_01 AC 13 ms
11,228 KB
testcase_02 AC 10 ms
11,164 KB
testcase_03 AC 23 ms
11,140 KB
testcase_04 AC 11 ms
10,996 KB
testcase_05 AC 7 ms
11,088 KB
testcase_06 AC 13 ms
11,104 KB
testcase_07 AC 18 ms
11,144 KB
testcase_08 AC 13 ms
11,220 KB
testcase_09 AC 19 ms
11,140 KB
testcase_10 AC 24 ms
11,088 KB
testcase_11 AC 11 ms
11,256 KB
testcase_12 AC 7 ms
11,108 KB
testcase_13 AC 12 ms
11,248 KB
testcase_14 AC 8 ms
11,244 KB
testcase_15 AC 13 ms
11,232 KB
testcase_16 AC 24 ms
11,084 KB
testcase_17 AC 24 ms
11,084 KB
testcase_18 AC 6 ms
11,040 KB
testcase_19 AC 6 ms
10,928 KB
testcase_20 AC 6 ms
10,996 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
typedef ModInt<1000000007> mint;
/*---------------------------------------------------------------------------------------------------
            ∧_∧
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     @hamayanhamayan0
    /   \     | |
    /   / ̄ ̄ ̄ ̄/  |
  __(__ニつ/     _/ .| .|____
     \/____/ (u ⊃
---------------------------------------------------------------------------------------------------*/














int N, p;
mint a[2010101];
//---------------------------------------------------------------------------------------------------
void _main() {
	cin >> N >> p;

	a[1] = 0;
	a[2] = 1;
	rep(i, 3, N + 1) a[i] = a[i - 1] * p + a[i - 2];

	mint sm = 0;
	mint ans = 0;
	rep(i, 1, N + 1) {
		sm += a[i];
		ans += sm * a[i];
	}
	cout << ans << endl;
}





0