Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
- // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
- // #pragma comment(linker, "/stack:200000000"]
- #include <iostream>
- #include <vector>
- #include <cmath>
- #include <algorithm>
- #include <unordered_set>
- #include <unordered_map>
- #include <set>
- #include <map>
- #include <queue>
- #include <deque>
- #include <bitset>
- #include <stack>
- #include <random>
- #include <fstream>
- #include <sstream>
- #include <chrono>
- #define fi first
- #define se second
- #define pb push_back
- #define ll long long
- #define ld long double
- #define hm unordered_map
- #define pii pair<int, int>
- #define sz(a) (int)a.size()
- #define all(a) a.begin(), a.end()
- #define cinv(v) for (auto& x: v) cin >> x
- #define fr(i, n) for (int i = 0; i < n; ++i)
- #define fl(i, l, n) for (int i = l; i < n; ++i)
- #define int ll
- template <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;}
- template <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;}
- using namespace std;
- #ifdef LOCAL
- #define dbg(x) cerr << #x << " : " << x << '\n'
- const int maxn = 20;
- #else
- #define dbg(x)
- const int maxn = 1e5 + 20;
- #endif
- //tg: @galebickosikasa
- ostream& operator << (ostream& out, const pii& v) {
- out << v.fi << ", " << v.se;
- return out;
- }
- template<typename T> ostream& operator << (ostream& out, const vector<T>& v) {
- for (auto& x: v) out << x << " ";
- return out;
- }
- istream& operator >> (istream& in, pii& a) {
- in >> a.fi >> a.se;
- return in;
- }
- const ll inf = (ll) 2e9;
- const ld pi = asin (1) * 2;
- const ld eps = 1e-8;
- const ll mod = (ll)1e9 + 7;
- const ll ns = 97;
- mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
- ll mult (ll a, ll b) {
- return a * b % mod;
- }
- ll add (ll a, ll b) {
- int c = a + b;
- if (c >= mod) c -= mod;
- return c;
- }
- ll powmod (ll a, ll n) {
- if (n == 0) return 1;
- if (n % 2) return mult (a, powmod (a, n - 1));
- ll b = powmod (a, n / 2);
- return mult (b, b);
- }
- ll inv (int a) {
- return powmod (a, mod - 2);
- }
- int f[maxn], rev[maxn];
- int C (int n, int k) {
- return mult (mult (f[n], rev[k]), rev[n - k]);
- }
- signed main () {
- ios_base::sync_with_stdio(false);
- cin.tie(nullptr);
- cout.tie(nullptr);
- int n;
- cin >> n;
- n /= 2;
- f[0] = 1;
- fl (i, 1, maxn) f[i] = mult (f[i - 1], i);
- rev[maxn - 1] = inv (f[maxn - 1]);
- for (int i = maxn - 2; i >= 0; --i) rev[i] = mult (rev[i + 1], i + 1);
- int ans = mult (C (2 * n, n), inv (n + 1));
- cout << ans << '\n';
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement