Submission #1832566

---

Source Code Expand

#include <iostream>
#include <vector>
#include <deque>
#include <math.h>
#include <set>
#include <iomanip>
#include <time.h>
#include <list>
#include <stdio.h>
#include <queue>
#include <map>
#include <algorithm>
#include <assert.h>
#include <memory.h>

#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define sz(s) ( (int)s.size() )
#define all(s) s.begin(), s.end()
#define int long long

using namespace std;

const int N = 2e6;

int n, a, sq, cur, step, ans;

main ()
{
    cin >> n >> a;

    if (n < a)
    {
        cout << n << endl;
        return 0;
    }
    sq = ceil(sqrt(n));

    if (a >= sq)
    {
        cur = sq;
        step = sq;

        ans = sq + a + 1;

        while (cur < n)
        {
            cur += step;
            ans++;
        }
        cout << min(n, ans) << endl;
    }
    else
    {
        cur = a + 1;
        step = a + 1;
        ans = a + a + 2;
        while (cur < n)
        {
            cur += step;
            ans++;
            step = cur;
            ans += a + 1;
        }
        cout << min(n, ans) << endl;
    }
}

Submission Info

Judge Result