import java.io.IOException;
import java.util.HashMap;
import java.util.Scanner;
public class MCOINS {
static int k;
static int l;
static HashMap<Integer, Boolean> map = new HashMap<Integer, Boolean>();
public static void main(String[] args) throws NumberFormatException, IOException {
Scanner sc = new Scanner(System.in);
k=sc.nextInt();
l=sc.nextInt();
int t = sc.nextInt();
while(sc.hasNext()){
int num = sc.nextInt();
System.out.print((canIWin(num%(1+l)))?"A":"B");
}
sc.close();
}
public static boolean canIWin(int num){
if(num<1)
return false;
if(num==1||num==k||num==l)
return true;
if(num<k){
return num%2!=0;
}
if(map.containsKey(num))
return map.get(num);
boolean value = !(canIWin(num-l)&&canIWin(num-k)&&canIWin(num-1));
map.put(num, value);
return value;
}
}
It ran for 22 test cases. Then gave wrong answer.
