【搜索】 HDOJ 4474 Yet Another Multiple Problem

不用什么数位DP， BFS搜就行了。。。

#include <iostream>  
#include <queue>  
#include <stack>  
#include <map>  
#include <set>  
#include <bitset>  
#include <cstdio>  
#include <algorithm>  
#include <cstring>  
#include <climits>  
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 10005
#define maxm 40005
#define eps 1e-10
#define mod 1000000007
#define INF 999999999
#define lowbit(x) (x&(-x))
#define mp mark_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid  
#define rson o<<1 | 1, mid+1, R  
typedef long long LL;
//typedef int LL;
using namespace std;
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

int vis[maxn];
int x[20], xcnt, hash[20];
int n, m;
struct node
{
	int res, f, y;
}q[maxn], now, tmp;
void read(void)
{
	int a;
	xcnt = 0;
	memset(hash, 0, sizeof hash);
	memset(vis, 0, sizeof vis);
	for(int i = 0; i < m; i++) {
		scanf("%d", &a);
		hash[a] = 1;
	}
	for(int i = 0; i <= 9; i++) if(hash[i] == 0) x[xcnt++] = i;
}
void work(void)
{
	int front = 1, rear = 1;
	for(int i = 0; i < xcnt; i++)
		if(!vis[x[i]%n] && x[i]) {
			vis[x[i]%n] = front;
			tmp.y = x[i];
			tmp.res = x[i]%n;
			tmp.f = -1;
			q[front++] = tmp;
		}
	while(front > rear) {
		now = q[rear++];
		for(int i = 0; i < xcnt; i++)
			if(!vis[(now.res*10 + x[i])%n]) {
				vis[(now.res*10 + x[i])%n] = front;
				tmp.y = x[i];
				tmp.res = (now.res*10 + x[i])%n;
				tmp.f = rear-1;
				q[front++] = tmp;
			}
	}
}
void print(int u)
{
	if(~q[u].f) print(q[u].f);
	printf("%d", q[u].y);
}
int main(void)
{
	int _ = 0;
	while(scanf("%d%d", &n, &m)!=EOF) {
		read();
		work();
		printf("Case %d: ", ++_);
		if(vis[0] == 0) printf("-1\n");
		else print(vis[0]), puts("");
	}
	return 0;
}