java min function

1Math.min(a, b);
2
3// a & b = int, double, long, or float

1System.out.println(Math.min(a, b));

1void shift_solution(int & x, int & y, int a, int b, int cnt) {
2    x += cnt * b;
3    y -= cnt * a;
4}
5
6int find_all_solutions(int a, int b, int c, int minx, int maxx, int miny, int maxy) {
7    int x, y, g;
8    if (!find_any_solution(a, b, c, x, y, g))
9        return 0;
10    a /= g;
11    b /= g;
12
13    int sign_a = a > 0 ? +1 : -1;
14    int sign_b = b > 0 ? +1 : -1;
15
16    shift_solution(x, y, a, b, (minx - x) / b);
17    if (x < minx)
18        shift_solution(x, y, a, b, sign_b);
19    if (x > maxx)
20        return 0;
21    int lx1 = x;
22
23    shift_solution(x, y, a, b, (maxx - x) / b);
24    if (x > maxx)
25        shift_solution(x, y, a, b, -sign_b);
26    int rx1 = x;
27
28    shift_solution(x, y, a, b, -(miny - y) / a);
29    if (y < miny)
30        shift_solution(x, y, a, b, -sign_a);
31    if (y > maxy)
32        return 0;
33    int lx2 = x;
34
35    shift_solution(x, y, a, b, -(maxy - y) / a);
36    if (y > maxy)
37        shift_solution(x, y, a, b, sign_a);
38    int rx2 = x;
39
40    if (lx2 > rx2)
41        swap(lx2, rx2);
42    int lx = max(lx1, lx2);
43    int rx = min(rx1, rx2);
44
45    if (lx > rx)
46        return 0;
47    return (rx - lx) / abs(b) + 1;
48}
49