Advertisement
Guest User

Untitled

a guest
May 4th, 2016
101
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.02 KB | None | 0 0
  1. #pragma comment(linker, "/STACK:1000000000")
  2. #include <iostream>
  3. #include <cmath>
  4. #include <algorithm>
  5. #include <vector>
  6. #include <cstring>
  7. #include <deque>
  8. #include <stack>
  9. #include <stdio.h>
  10. #include <map>
  11. #include <set>
  12. #include <time.h>
  13. #include <string>
  14. #include <fstream>
  15. #include <queue>
  16. #include <bitset>
  17. #include <cstdlib>
  18. #define X first
  19. #define Y second
  20. #define mp make_pair
  21. #define pb push_back
  22. #define pdd pair<double,double>
  23. #define pii pair<ll,ll>
  24. #define PI 3.14159265358979323846
  25. #define MOD 1000000007
  26. #define MOD2 (33LL+(ll)1e+17)
  27. #define INF (1LL+(ll)1e+9)
  28. #define x1 fldgjdflgjhrthrl
  29. #define x2 fldgjdflgrtyrtyjl
  30. #define y1 fldggfhfghjdflgjl
  31. #define y2 ffgfldgjdflgjl
  32. #define SQ 500400
  33. #define CI 43534
  34. #define N 228228
  35. #define eps 1e-9
  36. typedef long long ll;
  37. typedef long double ld;
  38. using namespace std;
  39. ll n, k;
  40. void dfs(ll x)
  41. {
  42. if (x == 1000000)
  43. return;
  44. dfs(x+1);
  45. k += x;
  46. }
  47. int main()
  48. {
  49. cin >> n;
  50. dfs(1);
  51. cout << n-1 << endl;
  52. return 0;
  53. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement