Difficulty: Easy
There are 7 floors in BH3 and only 2 lifts. Initially Lift A is at the ground floor and Lift B at the top floor. Whenever someone calls the lift from N th floor, the lift closest to that floor comes to pick him up. If both the lifts are at equidistant from the N th floor, them the lift from the lower floor comes up.
INPUT
First line contains a integer T denoting the number of test cases.
Next T lines contains a single integer N denoting the floor from which lift is called.
OUTPUT
Output T lines containing one character "A" if the first lift goes to N th floor or "B" for the second lift.
CONTRAINTS
0 <= N <= 7
1 <= T <= 100000
SAMPLE INPUT
2
3
5
SAMPLE OUTPUT
A
A
Explanation
3rd floor calls, Lift A(0) goes there.
5th floor calls, Lift A(3) and Lift B(7) are equidistant from 5, so Lift from lowest floor goes there i.e. A.
Recommended: Please try your approach on your integrated development environment (IDE) first, before moving on to the solution.
Few words from CodingHumans : Don't Just copy paste the solution, try to analyze the problem and solve it without looking by taking the the solution as a hint or a reference . Your understanding of the solution matters.
HAVE A GOOD DAY 😁
Solution
( Java )
import java.util.*;
public class LiftAB {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int t=sc.nextInt();
int a=0;
int b=7;
if(t>=1 && t<=100000){
while(t--!=0) {
int n=sc.nextInt();
if(b-n<n-a) {
System.out.println("B");
b=n;
}
else if(b-n==n-1) {
System.out.println("A");
a=n;
}
else {
System.out.println("A");
a=n;
}
}
sc.close();
}
}
}
If you have any doubts regarding this problem or need the solution in other programming languages then leave a comment down below .
