結果
問題 | No.554 recurrence formula |
ユーザー |
|
提出日時 | 2017-08-11 22:39:43 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 2,665 bytes |
コンパイル時間 | 1,610 ms |
コンパイル使用メモリ | 168,420 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-12 21:21:35 |
合計ジャッジ時間 | 2,167 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 21 |
ソースコード
#include "bits/stdc++.h"using namespace std;#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))#define rep(i,j) FOR(i,0,j)#define each(x,y) for(auto &(x):(y))#define mp make_pair#define MT make_tuple#define all(x) (x).begin(),(x).end()#define debug(x) cout<<#x<<": "<<(x)<<endl#define smax(x,y) (x)=max((x),(y))#define smin(x,y) (x)=min((x),(y))#define MEM(x,y) memset((x),(y),sizeof (x))#define sz(x) (int)(x).size()#define rt returnusing dbl = double;using ll = long long;using pii = pair<int, int>;using vi = vector<int>;using vll = vector<ll>;template<int MOD>class ModInt {public:ModInt() :value(0) {}ModInt(long long val) :value((int)(val<0 ? MOD + val%MOD : val%MOD)) { }ModInt& operator+=(ModInt that) {value = value + that.value;if (value >= MOD)value -= MOD;return *this;}ModInt& operator-=(ModInt that) {value -= that.value;if (value<0)value += MOD;return *this;}ModInt& operator*=(ModInt that) {value = (int)((long long)value * that.value % 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 pow(long long k) const {if (value == 0)return 0;ModInt n = *this, res = 1;while (k) {if (k & 1)res *= n;n *= n;k >>= 1;}return res;}ModInt inverse() const {long long a = value, b = MOD, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b;swap(a, b);u -= t * v;swap(u, v);}return ModInt(u);}int toi() const { return value; }private:int value;};typedef ModInt<1000000007> mint;ostream& operator<<(ostream& os, const mint& x) {os << x.toi();return os;}int main(){ios::sync_with_stdio(false);cin.tie(0);int n;cin >> n;mint od, ev;for (int i = 1; i <= n; ++i) {mint x;if (i == 1) {x = 1;} else {if (i % 2 == 0) {x = od*i;} else {x = ev*i;}}if (i % 2)od += x;else ev += x;if (i == n)cout << x << endl;}}