POJ 1426 Find The Multiple (BFS)

好题，相对应还有更难的题目

#include<iostream>
#include<cstdio>
#include<set>
#include<string>
#include<string.h>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<cctype>
#include<algorithm>
#include<sstream>
#include<utility>
#include<cmath>
#include<functional>
#define mt(a) memset(a,0,sizeof (a))
#define fl(a,b,c) fill(a,b,c)
#define SWAP(a,b,t) (t=a,a=b,b=t)

#define inf 1000000000+7

using namespace std;
typedef long long ll;
#define sp system("pause")

class node
{
public:
	int now;
	int yu;
	int dis[250];
};
int vis[250];

int main()
{
	int n;
	while (cin >> n, n)
	//for (int n = 1; n <= 200;n++)
	{
		queue<node>q;
		node start;
		memset(vis, 0, sizeof vis);
		start.now = 1;
		start.dis[0] = 1;
		start.yu = 1 % n;
		vis[start.yu] = 1;
		q.push(start);
		node ans;
		while (!q.empty())
		{
			node t = q.front();
			q.pop();
			node temp = t;
			if (temp.yu == 0){
				ans = temp; break;
			}
			if (!vis[(temp.yu * 10) % n])
			{
				temp.now++;
				temp.yu = (temp.yu * 10) % n;
				temp.dis[temp.now - 1] = 0;
				vis[temp.yu] = 1;
				q.push(temp);
			}
			temp = t;
			if (!vis[(temp.yu * 10 + 1) % n])
			{
				temp.now++;
				temp.yu = (temp.yu * 10 + 1) % n;
				temp.dis[temp.now - 1] = 1;
				vis[temp.yu] = 1;
				q.push(temp);
			}
		}
		for (int i = 0; i < ans.now; i++)
		{
			printf("%d", ans.dis[i]);
		}
		printf("\n");
	}
	return 0;
}