2016百度之星-初赛(Astar Round2A)AII X

#include <stdio.h>
#define ll long long
int OK(int x,ll m,int k,int c)
{
    int f[10000] = {0},r,t=0,left;
    for(r=1;r<=m;r++)
    {
        t = (10*t+x)%k;
        if(f[t])
        {
            left = (int)((m-f[t])%(r-f[t]));
            while(left--)
            {
                t = (10*t+x)%k;
            }
            return t == c;
        }
        f[t] = r;
    }
    return t == c;//m必然小于10001
}
int main()
{
    int T,x,k,c,i=1;
    ll m;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%lld%d%d",&x,&m,&k,&c);
        printf("Case #%d\n",i++);
        puts(OK(x,m,k,c)? "Yes" : "No");
    }
    return 0;
}
//1 5 5 1 Yes
//1 3 5 2 No
//1 3 5 1 Yes
//3 5 99 69 Yes
// 8 10000000000 32 14  No
//7 9999998777  24 17  Yes