poj 1426

宽搜

感觉这些搜索题都是重在想法，没有涉及剪枝

#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<queue>using namespace std;int bfs(int n){    queue<long long>q;    q.push(1);    while(!q.empty()){        long long p=q.front();        if(p%n==0)return p;        q.push(p*10);        q.push(p*10+1);        q.pop();        }}int main(){    int n;    while(~scanf("%d",&n)&&n){       cout<<bfs(n)<<endl;    }   return 0;}