Submission #1538739

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <time.h>
#include <stack>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cassert>

using namespace std;

const int N = 100005;
const int inf = 1000 * 1000 * 1000;
const int mod = 1000 * 1000 * 1000 + 7;

long long n,a;
long long answ;

void update(long long x){
    long long z = n / x;
    if(n % x)z++;
    answ = min(answ , x + a + z);
}

int main(){
    cin>>n>>a;
    //if(a == 0)assert(1 == 0);
    answ = n;
    for(long long i=2;i<n;i++){
        update(i);
    }
    cout<<answ<<endl;
    return 0;
}

Submission Info

Judge Result