Tuesday 11 August 2015

UVA 846 Steps (POJ - 2590, ZOJ - 1871)

///     Raihan Ruhin
///     CSE, Jahangirnagar University.
///     Dhaka-Bangladesh.
///     id: raihanruhin (topcoder / codeforces / codechef / hackerrank / uva / uvalive / spoj), 3235 (lightoj)
///     mail: raihanruhin@ (yahoo / gmail / facebook)
///     blog: ruhinraihan.blogspot.com

#include<bits/stdc++.h>
using namespace std;

#define SET(a) memset(a,-1,sizeof(a))
#define CLR(a) memset(a,0,sizeof(a))
#define PI acos(-1.0)

#define MOD 1000000007
#define MX 100010


int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    int tc, kk=1, n;
    long long lo, hi, dif, limit;
    string s;
    char ch;
    cin>>tc;
    while(tc--)
    {
        cin>>lo>>hi;
        dif=hi-lo;
        int step=0, inc=1;
        limit=0;
        while(dif>limit)
        {
            limit+=inc;
            step++;
            if(dif<=limit)
                break;
            limit+=inc;
            step++;
            inc++;
        }
        cout<< step <<"\n";
    }
return 0;
}

No comments:

Post a Comment