fork download
  1.  
  2. /////////////////////////////////////////////////////////////////////////
  3. // ------------------------------------------------------------------- //
  4. // | Author: Fananhkhoi | Luong Van Chanh High School for the gifted | //
  5. // ------------------------------------------------------------------- //
  6. /////////////////////////////////////////////////////////////////////////
  7.  
  8.  
  9. /* -------------------[ TALK LESS & DO MORE ]------------------- */
  10.  
  11.  
  12. // #pragma GCC target("popcnt,lzcnt,bmi,bmi2,abm")
  13.  
  14. #include <bits/stdc++.h>
  15. #include<ext/pb_ds/assoc_container.hpp>
  16. #include<ext/pb_ds/tree_policy.hpp>
  17. using namespace std;
  18. using namespace __gnu_pbds;
  19.  
  20. #define getBit(x, k) (((x) >> (k)) & 1)
  21. #define MASK(i) (1LL << (i))
  22. #define int long long
  23. //#define ll long long
  24. #define MOD 1000000007
  25. #define el "\n"
  26. #define vi vector<int>
  27. #define pii pair<int,int>
  28. #define vii vector<pii>
  29. #define FOU(i, l, r) for (int i = l; i <= r; i ++)
  30. #define FOD(i, r, l) for (int i = r; i >= l; i --)
  31. #define trav(a, x) for (auto &a : x )
  32. #define rep(i, a, b) for (int i = a; i < (b); i ++)
  33. #define gcd __gcd
  34. #define fi first
  35. #define se second
  36. #define MP make_pair
  37. #define pb push_back
  38. #define pf push_front
  39. #define all(v) v.begin(), v.end()
  40. #define rev(v) reverse(all(v))
  41. #define srt(v) sort(all(v))
  42. #define grtsrt(v) sort(all(v), greater<int>())
  43. #define sz(x) (int) (x).size()
  44. #define maxHeap priority_queue<int>
  45. #define minHeap priority_queue<int, vi, greater<int>>
  46. #define Fix(a, b) cout << fixed << setprecision((b)) << (a)
  47.  
  48. int dx[] = {};
  49. int dy[] = {};
  50.  
  51. template<class _, class __>
  52. bool minimize(_ &x, const __ y){
  53. if(x > y){
  54. x = y;
  55. return true;
  56. } else return false;
  57. }
  58. template<class _, class __>
  59. bool maximize(_ &x, const __ y){
  60. if(x < y){
  61. x = y;
  62. return true;
  63. } else return false;
  64. }
  65.  
  66. inline int max(int a, int b){
  67. return (a > b) ? a : b;
  68. }
  69.  
  70. inline int min(int a, int b){
  71. return (a < b) ? a : b;
  72. }
  73.  
  74. /* --------------------[ MAIN CODE ]--------------------- */
  75. const int MaxN = 1e6 + 50;
  76. const int oo = 2e18;
  77.  
  78. int n, k;
  79.  
  80. void inp(){
  81. cin >> n >> k;
  82. }
  83.  
  84. void sol(){
  85. if (k >= 2 * n){
  86. cout << "0";
  87. }
  88. else{
  89. if (k > n){
  90. int x = k - n;
  91. int tmp = (n + x - 1) / 2;
  92. cout << tmp - x + 1;
  93. }
  94. else{
  95. int x = 1, y = k - 1;
  96. int tmp = (x + y - 1) / 2;
  97. cout << tmp;
  98. }
  99. }
  100. }
  101.  
  102.  
  103. int32_t main()
  104. {
  105. ios_base::sync_with_stdio(false);
  106. cin.tie(NULL);
  107.  
  108. //freopen("PHANANHKHOI.INP", "r", stdin);
  109. //freopen("PHANANHKHOI.OUT", "w", stdout);
  110.  
  111. int t = 1;
  112. bool multitest = 0;
  113. if (multitest){
  114. cin >> t;
  115. }
  116. while(t--){
  117. inp();
  118. sol();
  119. }
  120. return 0;
  121. }
  122.  
Success #stdin #stdout 0s 5284KB
stdin
Standard input is empty
stdout
Standard output is empty