[BOJ 1011] Fly me to the Alpha Centauri

https://www.acmicpc.net/problem/1011

힌트는 https://www.acmicpc.net/board/view/13747 에 아주 상세히 적혀있다. 주의할 점은 i를 50000까지 했을때 int범위 벗어난다는 것이다. 후 ... (ll)안해서 계속 틀렸다 ..

#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <set>
#include <queue>
#include <stack>
#define MAX_N 11111111
#define INF 1e8
#define MOD 1000000007
 
typedef long long ll;
using namespace std;
 
ll t,a,b;
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >>t;
    while(t--){
        cin >>a >>b;
        ll diff = b-a;
        
        ll pos = 0;
        
        for(int i=1;i<=50000; i++){
            if(diff < (ll)i*i){
                pos = i;
                break;
            }
        }
        
        ll ans = ((pos-1)*2)-1;
        diff -= ((pos-1)*(pos-1));
        
        int t = (diff/(pos-1));
        
        if(diff%(pos-1) == 0){
            ans+=t;
        }else{
            ans +=(t+1);
        }
        cout << ans <<endl;
    }
}