Grepper

“java math.min” Code Answer

math minimum java

java by Abbot Of Boolean Zen on Feb 18 2020 Donate

Math.min(a, b);

// a & b = int, double, long, or float

java math.min

java by Breakable Boar on Jan 04 2021 Donate

// Java program to demonstrate the 
// use of min() function 
// two double data-type numbers are passed as argument 
public class Gfg { 
  
    public static void main(String args[]) 
    { 
        double a = 12.123; 
        double b = 12.456; 
  
        // prints the minimum of two numbers 
        System.out.println(Math.min(a, b)); 
    } 
}

Source: www.geeksforgeeks.org

math min max java

java by Vishal on Apr 30 2020 Donate

//	Mininum 
//	Math.min(a, b);
dataType min(dataType num1, dataType num2)
The datatypes can be int, float, double or long.

Parameters : The function accepts two parameters num1 and num2 
among which the minimum is returned.

//	Maximun
//	Math.max(a, b);
dataType max(dataType num1, dataType num2)
The datatypes can be int, float, double or long.

Parameters : The function accepts two parameters num1 and num2 
among which the maximum is returned.

Source: www.geeksforgeeks.org

java min function

java by Alert Albatross on May 27 2020 Donate

-1

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)
        shift_solution(x, y, a, b, sign_b);
    if (x > maxx)
        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;
}

Source: cp-algorithms.com