POJ 1465 Multiple（BFS+同于定理+打印路径）

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxm=1e4+10;
int vis[maxm];
int d[maxm];
int m,n;
int ok;
struct node
{
int pre;
int yu;
int dig;
}queue[maxm];
void output(node t)
{
if(t.pre!=-1)
{
output(queue[t.pre]);
printf("%d",t.dig);
}
return;
}
void bfs()
{
queue[0].pre=-1;
queue[0].yu=0;
queue[0].dig=0;
int e=0,h=1;
while(e<h)
{
node now=queue[e];
node t;
for(int i=0;i<n;i++)
{
int r=(now.yu*10+d[i])%m;
if((now.pre!=-1||d[i]>0)&&!vis[r])
{
vis[r]=1;
t.dig=d[i];
t.yu=r;
t.pre=e;
queue[h++]=t;
if(r==0)
{
ok=1;
output(t);
printf("\n");
break;
}
}
}
if(ok)
{
break;
}
e++;
}
if(!ok)
{
printf("0\n");
}
return;
}
int main()
{
while(scanf("%d%d",&m,&n)!=EOF)
{
for(int i=0;i<n;i++)
{
scanf("%d",&d[i]);
}
sort(d,d+n);
memset(vis,0,sizeof(vis));
ok=0;
if(m==0)
{
printf("0\n");
continue;
}
bfs();
}
return 0;
}