Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #pragma comment(linker, "/STACK:1000000000")
- #include <iostream>
- #include <cmath>
- #include <algorithm>
- #include <vector>
- #include <cstring>
- #include <deque>
- #include <stack>
- #include <stdio.h>
- #include <map>
- #include <set>
- #include <time.h>
- #include <string>
- #include <fstream>
- #include <queue>
- #include <bitset>
- #include <cstdlib>
- #define X first
- #define Y second
- #define mp make_pair
- #define pb push_back
- #define pdd pair<double,double>
- #define pii pair<ll,ll>
- #define PI 3.14159265358979323846
- #define MOD 1000000007
- #define MOD2 (33LL+(ll)1e+17)
- #define INF (1LL+(ll)1e+9)
- #define x1 fldgjdflgjhrthrl
- #define x2 fldgjdflgrtyrtyjl
- #define y1 fldggfhfghjdflgjl
- #define y2 ffgfldgjdflgjl
- #define SQ 500400
- #define CI 43534
- #define N 228228
- #define eps 1e-9
- typedef long long ll;
- typedef long double ld;
- using namespace std;
- ll n, k;
- void dfs(ll x)
- {
- if (x == 1000000)
- return;
- dfs(x+1);
- k += x;
- }
- int main()
- {
- cin >> n;
- dfs(1);
- cout << n-1 << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement