# 使用提供的代码查找Diophantine方程的解数时，在什么情况下执行带标记的if语句？

``````void shift_solution(int & x, int & y, int a, int b, int cnt) {
x += cnt * b;
y -= cnt * a;
}

int find_all_solutions(int a, int b, int c, int minx, int maxx, int miny, int maxy) {
int x, y, g;
if (!find_any_solution(a, b, c, x, y, g))
return 0;
a /= g;
b /= g;

int sign_a = a > 0 ? +1 : -1;
int sign_b = b > 0 ? +1 : -1;

shift_solution(x, y, a, b, (minx - x) / b);
if (x < minx)                                //1)when is this executed
shift_solution(x, y, a, b, sign_b);
if (x > maxx)                                //2)when is this executed
return 0;
int lx1 = x;

shift_solution(x, y, a, b, (maxx - x) / b);
if (x > maxx)
shift_solution(x, y, a, b, -sign_b);
int rx1 = x;

shift_solution(x, y, a, b, -(miny - y) / a);
if (y < miny)
shift_solution(x, y, a, b, -sign_a);
if (y > maxy)
return 0;
int lx2 = x;

shift_solution(x, y, a, b, -(maxy - y) / a);
if (y > maxy)
shift_solution(x, y, a, b, sign_a);
int rx2 = x;

if (lx2 > rx2)
swap(lx2, rx2);
int lx = max(lx1, lx2);
int rx = min(rx1, rx2);

if (lx > rx)
return 0;
return (rx - lx) / abs(b) + 1;
}
``````

...

THIS CODE IS COPIED FROM CP ALGORITHM WEBSITE LINK-https://cp-algorithms.com/algebra/linear-diophantine-equation.html