糟心啊

Description
Teacher thinks that we make a lot of progress. Now we are even allowed to use decimal notation instead of counting sticks. After the test the teacher promised to show us a “very beautiful number”. But the problem is, he’s left his paper with the number in the teachers’ office.

The teacher remembers that the “very beautiful number” was strictly positive, didn’t contain any leading zeroes, had the length of exactly p decimal digits, and if we move the last digit of the number to the beginning, it grows exactly x times. Besides, the teacher is sure that among all such numbers the “very beautiful number” is minimal possible.

The teachers’ office isn’t near and the teacher isn’t young. But we’ve passed the test and we deserved the right to see the “very beautiful number”. Help to restore the justice, find the “very beautiful number” for us!

Input
The single line contains integers p, x (1 ≤ p ≤ 106, 1 ≤ x ≤ 9).

Output
If the teacher’s made a mistake and such number doesn’t exist, then print on a single line “Impossible” (without the quotes). Otherwise, print the “very beautiful number” without leading zeroes.

Sample Input
Input
6 5
Output
142857
Input
1 2
Output
Impossible
Input
6 4
Output
102564
Hint
Sample 1: 142857·5 = 714285.

Sample 2: The number that consists of a single digit cannot stay what it is when multiplied by 2, thus, the answer to the test sample is “Impossible”.

#include <iostream>
#include <cstring>
using namespace std;
int l,time;
int s[1000009],t[1000009];
int main()
{
    cin>>l>>time;
    int flag=0;
    memset(t,-1,sizeof t);
    for(int i=1; i<=9; i++)
    {
        memset(s,0,sizeof s);
        s[1]=i;
        int tt=0;
        for(int j=2; j<=l+1; j++)
        {
            s[j]=(s[j-1]*time%10+tt)%10;
            tt=(s[j-1]*time+tt)/10;
        }
        if(tt!=0)
            continue;//这里这里这里！
        if(s[l+1]==s[1]&&s[l]!=0)//不可以为00000000！
        {
            int f=0;
            if(t[1]!=-1)
            {
               for(int kk=l;kk>0;kk--)
               {
                   if(s[kk]!=t[kk])
                   {
                       if(s[kk]<t[kk]&&s[l]!=0)
                        f=1;
                       break;
                   }
               }
            }
            if(t[1]==-1||f)
            {
                for(int kk=1; kk<=l; kk++)
                    t[kk]=s[kk];
            }
        }
    }
    if(t[1]==-1)
        cout<<"Impossible\n";
    else
    {
        for(int i=l; i>=1; i--)
            cout<<t[i];
        cout<<endl;
    }
    return 0;
}