本题
分析:
然后贪心枚举步数n,先满足②式,再满足①式,break就完事
有异曲同工之妙的一个题[codeforces 1260B]
(https://codeforces.com/contest/1260/problem/B)
总结:两个题都是先根据题意,用题目的opertions表示出两个数得到两个式子,然后加减两个式子,就水暗花明!
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<map>
#include<iostream>
#define ll long long
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
ll a,b;
cin>>a>>b;
ll s=a+b;
ll c=abs(a-b);
ll sum;
for(int i=0;i<=1000000000;i++)
{
sum=i*(i+1)/2;
if(sum>=c)
{
if((s+sum)%2==0)
{
cout<<i<<endl;
break;
}
}
}
}
return 0;
}