http://acm.hit.edu.cn/ojs/show.php?Proid=1018&Contestid=0
历时两天,十几个小时,历尽了千辛万苦,今天把终于把这道题A了,还是很有成就感的!
本题依旧是简单的BFS.思想很简单,先搜一位数,然后两位数~~直到搜到答案或搜索不能继续为止.搜索前要先对Xi进行排序,以保证搜到的数最小.注意答案可能很大,因此要用char数组存储,建立两个队列分别用来存储所搜索过程中所产生的数和相应的对N求余的余数,判断是否整除时只需对余数进行操作即可.注意记录答案那个队列要用循环数组实现,如果把它做为一个元素压进队会超时.另外要建立一个标数组检验余数是否出现过,出现过则不进队.
做这道题先在poj过了,但在hoj一直wrong,后来发现是2 2 3 4这类数据不正确,应该是4,可我的程序给出的是34。改过来之后就A了.
附代码
#include <iostream>
#include <cmath>
#include <queue>
#include <algorithm>
#include <functional>
#include <vector>
using namespace std;
const int qn = 5000;
char num[qn][5120];
int main()
{
bool flag[10000], mark;
int m, x[10], n, i, r, f, len, ans,pf, pr;
queue <int> q;
while (scanf("%d%d", &n, &m) == 2)
{
memset(flag, 0, sizeof(flag));
mark = false;
for (i = 0; i < m; i++)
{
scanf("%d", &x[i]);
}
if (n == 0)
{
printf("0/n");
continue;
}
sort(x, x+m);
while (q.size() > 0)
{
q.pop();
}
pf = pr = 0;
for (i = 0; i < m; i++)
{
if (x[i] != 0)
{
if (x[i] % n == 0)
{
num[pr][0] = x[i] + '0';
num[pr][1] = '/0';
ans = pr;
pr = (pr + 1) % qn;
mark = true;
break;
}
else if (flag[x[i]%n] == false)
{
flag[x[i]%n] = true;
num[pr][0] = x[i] + '0';
num[pr][1] = '/0';
pr = (pr + 1) % qn;
r = x[i]%n;
q.push(r);
}
}
}
while (mark == false && q.size() > 0)
{
f = q.front();
q.pop();
for (i = 0; i < m; i++)
{
r = (f * 10 + x[i]) % n;
if (r == 0)
{
strcpy(num[pr], num[pf]);
len = strlen(num[pr]);
num[pr][len] = x[i] + '0';
num[pr][len+1] = '/0';
ans = pr;
mark = true;
while (q.size() > 0)
{
q.pop();
}
break;
}
else if (flag[r] == false)
{
flag[r] = true;
strcpy(num[pr], num[pf]);
len = strlen(num[pr]);
num[pr][len] = x[i] + '0';
num[pr][len+1] = '/0';
pr = (pr + 1) % qn;
q.push(r);
}
}
pf = (pf + 1) % qn;
}
if (mark)
{
printf("%s/n", num[ans]);
}
else
{
printf("0/n");
}
}
return 0;
}