fork download 
  1. #include <bits/stdc++.h>  // This will work only for g++ compiler. 
  2.  
  3.  
  4. #define for0(i, n) for (int i = 0; i < (int)(n); ++i) // 0 based indexing
  5. #define for1(i, n) for (int i = 1; i <= (int)(n); ++i) // 1 based indexing
  6. #define forc(i, l, r) for (int i = (int)(l); i <= (int)(r); ++i) // closed interver from l to r r inclusive
  7. #define forr0(i, n) for (int i = (int)(n) - 1; i >= 0; --i) // reverse 0 based.
  8. #define forr1(i, n) for (int i = (int)(n); i >= 1; --i) // reverse 1 based
  9.  
  10. //short hand for usual tokens
  11. #define pb push_back
  12. #define fi first
  13. #define se second
  14.  
  15. // to be used with algorithms that processes a container Eg: find(all(c),42)
  16. #define all(x) (x).begin(), (x).end() //Forward traversal
  17. #define rall(x) (x).rbegin, (x).rend() //reverse traversal
  18.  
  19. // traversal function to avoid long template definition. Now with C++11 auto alleviates the pain.
  20. #define tr(c,i) for(__typeof__((c)).begin() i = (c).begin(); i != (c).end(); i++)
  21.  
  22. // find if a given value is present in a container. Container version. Runs in log(n) for set and map
  23. #define present(c,x) ((c).find(x) != (c).end())
  24.  
  25. //find version works for all containers. This is present in std namespace.
  26. #define cpresent(c,x) (find(all(c),x) != (c).end())
  27.  
  28. // Avoiding wrap around of size()-1 where size is a unsigned int.
  29. #define sz(a) int((a).size())
  30.  
  31.  
  32. using namespace std;
  33.  
  34. // Shorthand for commonly used types
  35. typedef vector<int> vi;
  36. typedef vector<vi> vvi;
  37. typedef pair<int, int> ii;
  38. typedef vector<ii> vii;
  39. typedef long long ll;
  40. typedef vector<ll> vll;
  41. typedef vector<vll> vvll;
  42. typedef double ld;
  43.  
  44.  
  45.  
  46. int main() {
  47.     ios::sync_with_stdio(false);
  48.     cin.tie(0);
  49.     cout.precision(10);
  50.     cout << fixed;
  51. 	long long  n,m;
  52. 	cin>>n>>m;
  53. 	long long x=n;
  54. 	long long i=1;
  55. 	while(true){
  56. 		x = min(n,x+m);
  57. 		x-=i;
  58. 		if(x<=0){
  59. 			cout<<i<<endl;
  60. 			break;
  61. 		}
  62. 		i++;
  63. 	}
  64.     return 0;
  65. }
Success #stdin #stdout 0.01s 5284KB
comments (?)
stdin 
5 2
stdout 
4
https://ideone.com/GU80N3
language:
C++ (gcc 8.3)
created:
12 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!