fork download
copy 
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. typedef long long ll;
  6. typedef unsigned int ul;
  7. typedef unsigned long long ull;
  8.  
  9. #define mask(i) (1LL << (i))
  10. #define getbit(mask, i) (((mask) >> (i)) & 1)
  11. #define all(v) (v).begin(), (v).end()
  12. #define IN "A.INP"
  13. #define OUT "A.OUT"
  14. #define int long long
  15.  
  16. ll gcd(ll a, ll b){return __gcd(a, b);}
  17. ll lcm(ll a, ll b){return a/gcd(a,b)*b;}
  18.  
  19. ll lastbit(ll mask){return (mask) & (-mask);}
  20. int pop_cnt(ll mask){return __builtin_popcountll(mask);}
  21. int ctz(ull mask){return __builtin_ctzll(mask);}
  22.  
  23. template <class T1, class T2>
  24.     bool maximize(T1 &a, T2 b){
  25.         if (a < b) {a = b; return true;}
  26.         return false;
  27.     }
  28.  
  29. template <class T1, class T2>
  30.     bool minimize(T1 &a, T2 b){
  31.         if (a > b) {a = b; return true;}
  32.         return false;
  33.     }
  34.  
  35. template <class T>
  36.     void printarr(T the_array_itself, string separator = " ", string finish = "\n", ostream &out = cout){
  37.         for(auto item: the_array_itself) out << item << separator;
  38.         out << finish;
  39.     }
  40.  
  41. template <class T>
  42.     void remove_dup(vector<T> &a){
  43.         sort(all(a));
  44.         a.resize(unique(all(a)) - a.begin());
  45.     }
  46.  
  47. const long long inf = 1e18, MOD = 1e9+7;
  48.  
  49. struct Modular{
  50.     ll x;
  51.     Modular(ll _x = 0){
  52.         x = _x % MOD;
  53.         if (x < 0) x += MOD;
  54.     }
  55.     Modular& operator += (Modular y){
  56.         x += y.x;
  57.         if (x >= MOD) x -= MOD;
  58.         return *this;
  59.     }
  60.     Modular operator + (Modular y) {
  61.         Modular tmp = *this;
  62.         return tmp += y;
  63.     }
  64.  
  65.     Modular& operator -= (Modular y){
  66.         x -= y.x;
  67.         if (x < 0) x += MOD;
  68.         return *this;
  69.     }
  70.     Modular operator - (Modular y) {
  71.         Modular tmp = *this;
  72.         return tmp -= y;
  73.     }
  74.  
  75.     Modular& operator *= (Modular y){
  76.         x *= y.x;
  77.         if (x >= MOD) x %= MOD;
  78.         return *this;
  79.     }
  80.     Modular operator * (Modular y) {
  81.         Modular tmp = *this;
  82.         return tmp += y;
  83.     }
  84.  
  85.     // use at your own risk
  86.     bool operator == (Modular y){
  87.         return x == y.x;
  88.     }
  89.     bool operator != (Modular y){
  90.         return x != y.x;
  91.     }
  92. };
  93. ostream& operator << (ostream& out, Modular x){
  94.     out << x.x;
  95.     return out;
  96. }
  97.  
  98. Modular fast_pow(Modular a, int n){
  99.     Modular ans = 1;
  100.     while(n > 0){
  101.         if (n & 1) ans *= a;
  102.         a *= a;
  103.         n >>= 1;
  104.     }
  105.     return ans;
  106. }
  107. Modular inverse(Modular a){return fast_pow(a, MOD - 2);}
  108.  
  109. const int N = 6e5 + 69;
  110. vector<Modular> fact(N), ifact(N);
  111.  
  112. void prepare(){
  113.     fact[0] = 1;
  114.     for(int i = 1; i < N; ++i) fact[i] = fact[i-1] * i;
  115.     ifact[N - 1] = inverse(fact[N-1]);
  116.     for(int i = N-1; i >= 1; --i) ifact[i-1] = ifact[i] * i;
  117. }
  118.  
  119. Modular C(int n, int k){
  120.     if (k < 0 || k > n) return 0;
  121.     return fact[n] * ifact[k] * ifact[n-k];
  122. }
  123.  
  124. Modular Catalan(int n){
  125.     if (n % 2 != 0) return 0;
  126.     return C(n, n / 2) - C(n, n / 2 + 1);
  127. }
  128.  
  129. // End of the template, let's drink a cup of water before reading:D
  130. // Template use for ONLINE JUDGE
  131.  
  132. void solve(){
  133.  
  134. }
  135.  
  136. signed main(){
  137.     ios_base::sync_with_stdio(0); cin.tie(0);
  138.     int t = 1;
  139.     //cin >> t;
  140.     while(t--) solve();
  141.     cerr << "Time elapsed: " << (1.0 * clock() / CLOCKS_PER_SEC) << " s.\n";
  142.     return 0;
  143. }
  144.  
Success #stdin #stdout #stderr 0.01s 12444KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
stderr
copy 
Time elapsed: 0.007251 s.
https://ideone.com/AbJio1
language:
C++14 (clang 8.0)
created:
8 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!