You learned that properly edited resumes are necessary for making a good impression on a university or a potential employer. Dis
1 answer:
You might be interested in
The brute strength method determines if each x and y value satisfies both conditions. To do this, we must iterate through each result in the specified range and insert them into both models.
<h3>What are Elegant mathematical technique?</h3>ALGORITHM :
1. Take the values of all coefficients and SET flag = FALSE
2. Run a FOR loop for x in range (-10, 11). 11 won't be included.
2a. Inside the first FOR, start the y FOR loop in range(-10,11). 11 won't be included
2b. Inside the y FOR loop, check IF for a particular value of x and y both the equations satisfied.
2c. If yes, set flag TRUE and print values of x and y.
2d. ELSE the flag stays FALSE.
END FOR Y
END FOR X
3. Check if flag = FALSE, then print NO SOLUTION
PYTHON CODE :
a=int(input()) #taking input for each coefficient
b=int(input())
c= int(input())
a1= int(input())
b1= int(input())
c1= int(input())
flag = False
for x in range(-10,11): #checking for all values of x in range -10 to 10
for y in range(-10,11): #checking for all values of x in range -10 to 10
if (a x + b y – c == 0) and (a1*x + b1*y - c1 == 0) : #checking if the x and y values satisfy the equation
flag = True #setting the flag if solution is found
print('Solution : x = {-10, 10}, y = {-10, 10}'.format(x,y)) #if they satisfy print x & y
if flag = False : #if flag stays false, that means there is no solution
print('No solution')
OUTPUT : The output is given below.
More about the Elegant mathematical technique link is given below.
#SPJ1
Answer:
The answer is ""
Explanation:
Given:
The Merge-And-Count of (A,B) runs in time |Al+IB|
T(n) recurrence=?
Calculating the value of the recurrence: