Multiplication Game（博弈论）

Description

Alice and Bob are in their class doing drills on multiplication and division. They quickly get bored and instead decide to play a game they invented.

The game starts with a target integer N≥2N≥2 , and an integer M=1M=1. Alice and Bob take alternate turns. At each turn, the player chooses a prime divisor p of N, and multiply M by p. If the player’s move makes the value of M equal to the target N, the player wins. If M>NM>N , the game is a tie. Assuming that both players play optimally, who (if any) is going to win?

Input

The first line of input contains T(1≤T≤10000)T(1≤T≤10000) , the number of cases to follow. Each of the next T lines describe a case. Each case is specified by N(2≤N≤231−1)N(2≤N≤231−1) followed by the name of the player making the first turn. The name is either Alice or Bob.

Output

For each case, print the name of the winner (Alice or Bob) assuming optimal play, or tie if there is no winner.

Sample Input

10
10 Alice
20 Bob
30 Alice
40 Bob
50 Alice
60 Bob
70 Alice
80 Bob
90 Alice
100 Bob

Sample Output

Bob
Bob
tie
tie
Alice
tie
tie
tie
tie
Alice

找到n的所有素因子 依次说出一个素数乘以M 
看谁轮到谁的时候M==N  
如果M>N 则平局
找规律当 素因子种类大于3个的时候，
其实可以在两个回合内预判对方能不能赢和自己能不能赢
双方都能够判断所以最好的结果只能是tie 

当素因子种类为2时，当素因子个数差大于1的时候 是没有解的 这个考自己找规律
就是一个对称博弈 ，这个就是先后手的问题了 
当种类数为1的时候 这个就非常显然了

 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 #include <stack>
 #include <string>
 #include <math.h>
 #include <vector>
 using namespace std;

 const int maxn = 1e5+;

 int vis[maxn], prime[maxn], k;
 int sum[] ;
 void init() {
     memset(vis, , sizeof(vis));
     k = ;
     for (int i =  ; i < maxn ; i++ ) {
         if (vis[i]) continue;
         for (int j =  * i ; j < maxn ; j += i )
             vis[j] = ;
         vis[i] = ;
         prime[k++] = i;
     }
 }
 int main() {
     int t;
     init();
     scanf("%d", &t);
     while(t--) {
         int n, tot = , m;
         char name[];
         memset(sum, , sizeof(sum));
         scanf("%d%s", &n, name);
         m = n;
         for (int i =  ; i < k && prime[i]*prime[i] <= m  ; i++) {
             if (m % prime[i] == ) {
                 while(m % prime[i] == ) {
                     sum[tot]++;
                     m = m / prime[i];
                 }
                 tot++;
             }
         }
         if (m != ) {
             sum[tot]++;
             tot++;
         }
         if (tot >= ) printf("tie\n");
         else if(tot == ) {
             int temp = abs(sum[] - sum[]);
             if (temp == )  printf("%s\n", (name[] == 'A') ? "Bob" : "Alice");
             else if (temp == ) printf("%s\n", (name[] == 'B') ? "Bob" : "Alice");
             else printf("tie\n");
         } else if (tot == ) {
             if (sum[] & ) printf("%s\n", (name[] == 'B') ? "Bob" : "Alice");
             else  printf("%s\n", (name[] == 'A') ? "Bob" : "Alice");
         }
     }
     return ;
 }