fork download
copy 
  1. /* AUTHOR: TUAN ANH - BUI */
  2. // ~~ icebear ~~
  3. #include <bits/stdc++.h>
  4. using namespace std;
  5.  
  6. typedef long long ll;
  7. typedef pair<int, int> ii;
  8. typedef pair<int, ii> iii;
  9.  
  10. template<class X, class Y>
  11.     bool minimize(X &x, const Y &y) {
  12.         if (x > y) return x = y, true;
  13.         return false;
  14.     }
  15.  
  16. template<class X, class Y>
  17.     bool maximize(X &x, const Y &y) {
  18.         if (x < y) return x = y, true;
  19.         return false;
  20.     }
  21.  
  22. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  23. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  24. #define REP(i, n) for(int i=0; i<(n); ++i)
  25. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  26. #define MASK(i) (1LL << (i))
  27. #define BIT(S, i) (((S) >> (i)) & 1)
  28. #define mp make_pair
  29. #define pb push_back
  30. #define fi first
  31. #define se second
  32. #define all(x) x.begin(), x.end()
  33. #define task "icebear"
  34. /*END OF TEMPLATE. ICEBEAR AND THE CAT WILL WIN VOI26 */
  35.  
  36. const int MOD = 1e9 + 7;
  37. const int inf = (int)1e9 + 27092008;
  38. const ll INF  = (ll)1e18 + 27092008;
  39. const int N = 1e6 + 5;
  40. int n, sz[N], f[N], fact[N], finv[N];
  41. int power(int x, int k) {
  42.     int res = 1;
  43.     while(k > 0) {
  44.         if (k & 1) res = 1LL * res * x % MOD;
  45.         k >>= 1;
  46.         x = 1LL * x * x % MOD;
  47.     }
  48.     return res;
  49. }
  50.  
  51. int C(int k, int n) {
  52.     return (k > n ? 0 : 1LL * fact[n] * finv[k] % MOD * finv[n - k] % MOD);
  53. }
  54.  
  55. void init(void) {
  56.     cin >> n;
  57.     fact[0] = 1;
  58.     FOR(i, 1, n) fact[i] = 1LL * fact[i - 1] * i % MOD;
  59.     finv[n] = power(fact[n], MOD - 2);
  60.     FORR(i, n, 1) finv[i - 1] = 1LL * finv[i] * i % MOD;
  61. }
  62.  
  63. void process(void) {
  64.     FORR(i, n, 1) {
  65.         int l = 2 * i;
  66.         int r = 2 * i + 1;
  67.         f[i] = sz[i] = 1;
  68.         if (l <= n) sz[i] += sz[l], f[i] = 1LL * f[i] * f[l] % MOD;
  69.         if (r <= n) sz[i] += sz[r], f[i] = 1LL * f[i] * f[r] % MOD;
  70.         if (l <= n && r <= n) f[i] = 1LL * f[i] * C(sz[l], sz[l] + sz[r]) % MOD;
  71.     }
  72.     cout << f[1];
  73. }
  74.  
  75. int main() {
  76.     ios_base::sync_with_stdio(0);
  77.     cin.tie(0); cout.tie(0);
  78.     if (fopen(task".inp", "r")) {
  79.         freopen(task".inp", "r", stdin);
  80.         freopen(task".out", "w", stdout);
  81.     }
  82.     int tc = 1;
  83. //    cin >> tc;
  84.     while(tc--) {
  85.         init();
  86.         process();
  87.     }
  88.     return 0;
  89. }
  90.  
  91.  
Success #stdin #stdout 0.01s 5596KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/ETqlaK
language:
C++14 (gcc 8.3)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!