HDU-4471 Yet Another Multiple Problem （BFS+路径还原）

Problem Description

There are tons of problems about integer multiples. Despite the fact that the topic is not original, the content is highly challenging. That’s why we call it “Yet Another Multiple Problem”.
In this problem, you’re asked to solve the following question: Given a positive integer n and m decimal digits, what is the minimal positive multiple of n whose decimal notation does not contain any of the given digits?

 

Input

There are several test cases.
For each test case, there are two lines. The first line contains two integers n and m (1 ≤ n ≤ 10⁴). The second line contains m decimal digits separated by spaces.
Input is terminated by EOF.

 

Output

For each test case, output one line “Case X: Y” where X is the test case number (starting from 1) while Y is the minimal multiple satisfying the above-mentioned conditions or “-1” (without quotation marks) in case there does not exist such a multiple.

 

Sample Input

2345 3

7 8 9

100 1

0 

 

Sample Output

Case 1: 2345

Case 2: -1

 

 题目大意：要求不用给出的m个数字，组成n的最小倍数。

 题目分析：本题看似是简单的BFS，实际上按常规的BFS写会WA。因为答案有可能超过64位，应该按照路径来写。以模n作为状态，不光要记录到达当前状态的前一状态，还要记录在当前状态最后一个加进来的数字。这道题的坑就在这儿。

 

 

代码如下：

 # include<iostream>
 # include<cstdio>
 # include<queue>
 # include<cstring>
 # include<algorithm>
 using namespace std;
 # define ull unsigned long long
 const int N=;
 int mark[],pre[N],lst[N];
 void print(int id)
 {
     if(pre[id]!=-)
         print(pre[id]);
     printf("%d",lst[id]);
 }
 void bfs(int n)
 {
     queue<int>q;
     memset(lst,-,sizeof(lst));
     memset(pre,-,sizeof(pre));
     for(int i=;i<;++i){
         if(!mark[i]){
             if(i%n==){
                 printf("%d\n",i);
                 return ;
             }
             lst[i%n]=i;
             q.push(i%n);
         }
     }
     while(!q.empty())
     {
         int u=q.front();
         q.pop();
         for(int i=;i<;++i){
             if(!mark[i]){
                 int nxt=(u*+i)%n;
                 if(lst[nxt]==-){
                     lst[nxt]=i;
                     pre[nxt]=u;
                     q.push(nxt);
                 }
                 if(nxt==){
                     print(nxt);
                     printf("\n");
                     return ;
                 }
             }
         }
     }
     printf("-1\n");
 }
 int main()
 {
     int n,m,cas=;
     while(scanf("%d%d",&n,&m)!=EOF)
     {
         int num;
         memset(mark,,sizeof(mark));
         while(m--)
         {
             scanf("%d",&num);
             mark[num]=;
         }
         printf("Case %d: ",++cas);
         bfs(n);
     }
     return ;
 }