Question

6.11 LAB: Brute force equation solver Numerous engineering and scientific applications require finding solutions to a set of equations. Ex 8x + 7) = 38 and 3x - 5y = -1 have a solution x = 3, y = 2. Given integer coefficients of two linear equations with variables x and y, use brute force to find an integer solution for X and y in the range - 10 to 10 Ex: If the input is 8 7 38 3-51 the output is 3 2 Use this brute force approach: For every value of x from -10 to 10 For every value of y from -10 to 10 Check if the current x and y satisfy both equations. If so output the solution, and finish. Ex: If no solution is found output: No solution You can assume the two equations have no more than one solution Note: Elegant mathematical techniques exist to solve such linear equations. However, for other kinds of equations or situations, brute force can be handy

Java

Answer 1

*****************************************************************************
PLEASE DO UPVOTE IF THE ANSWER IS HELPFUL AS IT GIVES THE CONFIDENCE TO HELP MORE STUDENTS
*****************************************************************************
In case If I have not answered completely, it's because Chegg allows me to answer a specific no of questions including the subparts, so please do post the rest of the questions as a separate query as per Chegg Guidelines. Thank you :)
*****************************************************************************

import java.util.*;

class Hello {

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);

        int a, b, c, x, y, z;

        int p, q;

        a = sc.nextInt();

        b = sc.nextInt();

        c = sc.nextInt();

        x = sc.nextInt();

        y = sc.nextInt();

        z = sc.nextInt();

        int flag = 0;

        for (int i = -10; i <= 10; i++) {

            for (int j = -10; j <= 10; j++) {

                if ((a * i + b * j == c) && (x * i + y * j == z)) {

                    System.out.println(i + " " + j);

                    flag = 1;

                }

                if (flag == 1)

                    break;

            }

            if (flag == 1)

                break;

        }

        if (flag == 0) {

            System.out.println("No solution");

        }

   }}

878 3-5 -1 32