{
long long k=-x/y;
if (m<0) k=(m-x)/y;
j+=k;
x+=k*y;
b=1;
}
else
{
j++;
x+=y;
}
}
return j;
}
int main()
{
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
for(n=3;f[n-1] return 0;
// For(i,n) cout<
cout<
}
CF 317A(Perfect Pair-广义Fib序列p,q=1性质2&加法增长极) (二)
<0&&y>0)
{
long long k=-x/y;
if (m<0) k=(m-x)/y;
j+=k;
x+=k*y;
b=1;
}
else
{
j++;
x+=y;
}
}
return j;
}
int main()
{
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
{
long long k=-x/y;
if (m<0) k=(m-x)/y;
j+=k;
x+=k*y;
b=1;
}
else
{
j++;
x+=y;
}
}
return j;
}
int main()
{
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);