Question 1.
You are given three integers: A, B, and N. Your task is to determine whether it is possible to reach the value N starting from either A or B using the one of the following operations:
- Replace A with A + B.
OR - Replace B with A + B.
If it is possible to reach N, print the minimum number of operations required. If it is not possible print NOT POSSIBLE.
Constraints :- [-10000000000 <= A, B, N <= 10000000000].
Example 1:
Input : 1, 2, 5
Output : 2
Explanation : (1, 2) -> (2, 3) -> (3, 5)Example 2:
Input : -1, 0, 5
Output : NOT POSSIBLE
Explanation : (-1, 0) -> (-1, 0)
State are either remain unchanged or produce Negative value for both A and B.#include<bits/stdc++.h>
using namespace std;
int Minimum_Number_Of_Operation(int A, int B, int N){
// Write Your Code Here
}
int main(){
int A, B, N;
cin >> A >> B >> N;
cout << Minimum_Number_Of_Operation(A, B, N);
return 0;
}Comments (3)