题意: 对一个数字有两种操作: (1) 反转, (2) 除以 10 取整. 给你A, B两个数,Alice只能操作数字A,Bob只能操作数字B,如果Alice或Bob执行某次操作后A = B, Alice赢,否则就一直执行下去.
分析: 由于A,B <= 10^100000,所以对数字的操作要当做字符串来处理. 很容易看出, 如果B是A的子串或者B’(B反转一次)是A的子串,那么经过有限次操作,肯定能达到A = B的状态. 需要注意的是: (1)如果B一开始等于0,最后也能达到A = B的状态; (2) 如果B后面0,需要将0去除,因为B执行反转后,在后面的0将成为前导0.
#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#include<string>
#include<cstring>
#include<cmath>
#include<set>
#include<iostream>
using namespace std;
typedef long long ll;
#define ull unsigned long long
const int maxn = 1e5 + 10;
const int inf = 1 << 30;
const double eps = 1e-8;
char s1[maxn], s2[maxn], s3[maxn];
const ull B = 1e8 + 7;
int contain(char *a, char *b)
{
int al = strlen(a), bl = strlen(b);
if(al > bl) return 0;
ll t = 1;
for(int i = 0; i < al; i++) t *= B;
ll ah = 0, bh = 0;
for(int i = 0; i < al; i++) ah = ah * B + a[i];
for(int i = 0; i < al; i++) bh = bh * B + b[i];
for(int i = 0; i + al <= bl; i++) {
if(ah == bh) return 1;
if(i + al < bl) bh = bh * B + b[i + al] - b[i] * t;
}
return 0;
}
int main() {
int n, m, t;
scanf("%d", &t);
while(t--) {
scanf("%s %s", s1, s2);
int l = strlen(s1), l2 = strlen(s2);
for(int i = l2 - 1; i >= 0; i--) {
if(s2[i] == '0') s2[i] = '\0';
if(s2[i] != '0') break;
}
//printf("s2 = %s\n", s2);
for(int i = 0; i < l; i++) {
s3[l - i - 1] = s1[i];
}
s3[l] = '\0';
if(contain(s2, s1) + contain(s2, s3) > 0) printf("Alice\n");
else printf("Bob\n");
}
return 0;
}