fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29. int nCr(int n, int r){
  30. if(r>n || r<0) return 0;
  31.  
  32. //* Optimization
  33. if(r > n-r) r = n-r;
  34.  
  35. int res = 1;
  36. for(int i=1; i<=r; i++){
  37. res *= (n-r+i);
  38. res /= i;
  39. }
  40.  
  41. return res;
  42. }
  43.  
  44. int consistency(int m, int n){
  45.  
  46. return nCr(m+n-2, m-1);
  47.  
  48. }
  49.  
  50.  
  51.  
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64. int practice(int m, int n){
  65.  
  66.  
  67. return 0;
  68. }
  69.  
  70.  
  71.  
  72.  
  73.  
  74. void solve() {
  75.  
  76. int m, n;
  77. cin>> m >> n;
  78.  
  79.  
  80. cout << consistency(m, n) << endl;
  81.  
  82.  
  83. }
  84.  
  85.  
  86.  
  87.  
  88.  
  89. int32_t main() {
  90. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  91.  
  92. int t = 1;
  93. // cin >> t;
  94. while (t--) {
  95. solve();
  96. }
  97.  
  98. return 0;
  99. }
Success #stdin #stdout 0.01s 5324KB
stdin
3 7
stdout
28