FZU 2275 Game (KMP)

最新推荐文章于 2019-05-08 23:29:54 发布

原创最新推荐文章于 2019-05-08 23:29:54 发布 · 1.3k 阅读

0 ·

CC 4.0 BY-SA版权

FZU 同时被 2 个专栏收录

17 篇文章

订阅专栏

KMP

10 篇文章

订阅专栏

本文介绍了一个涉及字符串操作的游戏问题，玩家需通过翻转和除法操作使两个数字相等。主要内容包括游戏规则说明、输入输出格式及示例，并提供了解决方案的C++代码实现。

Problem 2275 Game

Accept: 99 Submit: 270
Time Limit: 1000 mSec Memory Limit : 262144 KB

Problem Description

Alice and Bob is playing a game.

Each of them has a number. Alice’s number is A, and Bob’s number is B.

Each turn, one player can do one of the following actions on his own number:

1. Flip: Flip the number. Suppose X = 123456 and after flip, X = 654321

2. Divide. X = X/10. Attention all the numbers are integer. For example X=123456 , after this action X become 12345（but not 12345.6）. 0/0=0.

Alice and Bob moves in turn, Alice moves first. Alice can only modify A, Bob can only modify B. If A=B after any player’s action, then Alice win. Otherwise the game keep going on!

Alice wants to win the game, but Bob will try his best to stop Alice.

Suppose Alice and Bob are clever enough, now Alice wants to know whether she can win the game in limited step or the game will never end.

Input

First line contains an integer T (1 ≤ T ≤ 10), represents there are T test cases.

For each test case: Two number A and B. 0<=A,B<=10^100000.

Output

For each test case, if Alice can win the game, output “Alice”. Otherwise output “Bob”.

Sample Input

411111 11 1111112345 54321123 123

Sample Output

AliceBobAliceAlice

Hint

For the third sample, Alice flip his number and win the game.

For the last sample, A=B, so Alice win the game immediately even nobody take a move.

Source

第八届福建省大学生程序设计竞赛-重现赛（感谢承办方厦门理工学院）

题意很好懂。

POINT：

la<lb 肯定bob赢。如果bob一开始就是0，alice赢。

其他情况就是判断a串中有没有串b或串反b，KMP裸题。

KMP模版是kuangbin的。

#include <stdio.h>
#include <iostream>
using namespace std;
void kmp_pre(char x[],int m,int next[])
{
    int i,j;
    j=next[0]=-1;
    i=0;
    while(i<m)
    {
        while(-1!=j && x[i]!=x[j])
            j=next[j];
        next[++i]=++j;
    }
}
int Next[10010];
int KMP_Count(char x[],int m,char y[],int n)
{//x是模式串，y是主串
    int i,j;
    int ans=0;
    kmp_pre(x,m,Next);
    i=j=0;
    while(i<n)
    {
        while(-1!=j&&y[i]!=x[j])
            j=Next[j];
        i++;j++;
        if(j>=m)
        {
            ans++;
            j=Next[j];
        }
    }
    return ans;
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        char x[100000+3];
        char y[100000+3];
        cin>>x>>y;
        int m=strlen(x);
        int n=strlen(y);
        if(y[0]=='0'&&n==1){printf("Alice\n");continue;}
        if(n>m) printf("Bob\n");
        else
        {
            char yy[100000+3];
            if(KMP_Count(y, n, x, m))
            {
                printf("Alice\n");
                continue;
            }
            for(int i=0;i<n;i++)
            {
                yy[n-1-i]=y[i];
            }
            yy[n]='\0';
            if(KMP_Count(yy, n, x, m))
            {
                printf("Alice\n");
                continue;
            }
            printf("Bob\n");
            
        }
    }
}