POJ 1426

#include <iostream>
#define MAXN 100
#define index _index

using namespace std;

bool boo;
int n;
int ans[MAXN];

int index;

void DFS(int num,int wide);

int main()
{
  //  freopen("in.txt","r",stdin);
  //  freopen("out.txt","w",stdout);
    while(cin>>n,n)
    {
        boo = false;
        index = 0;
        ans[index ++] = 1;
        //cout<<n<<endl;
        DFS(1,1);
    }
}

void DFS(int num,int wide)
{
    if(boo)
    {
        return;
    }
    if(num == 0)
    {
        int i;
        for(i = 0; i < index; ++ i)
        {
            cout<<ans[i];
        }
        cout<<endl;
       // cout<<" ********* "<<endl;
        boo = true;
        return;
    }
    //cout<<num<<endl;
    if(wide < 100)
    {
        ans[index ++] = 0;
        DFS( (num*10)%n,wide + 1);
        if(boo)
            return;
        -- index;
        ans[index ++] = 1;
        DFS( (num*10+1)%n,wide + 1);
        -- index;
    }
}

关注我的公众号，当然，如果你对Java, Scala, Python等技术经验，以及编程日记，感兴趣的话。 

技术网站地址： vmfor.com