HDU 4474 Yet Another Multiple Problem

bfs。求n的最小倍数，要求其中不包含所给的数字。通过余数来判重。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
///LOOP
#define REP(i, n) for(int i = 0; i < n; i++)
#define FF(i, a, b) for(int i = a; i < b; i++)
#define FFF(i, a, b) for(int i = a; i <= b; i++)
#define FD(i, a, b) for(int i = a - 1; i >= b; i--)
#define FDD(i, a, b) for(int i = a; i >= b; i--)
///INPUT
#define RI(n) scanf("%d", &n)
#define RII(n, m) scanf("%d%d", &n, &m)
#define RIII(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define RIV(n, m, k, p) scanf("%d%d%d%d", &n, &m, &k, &p)
#define RV(n, m, k, p, q) scanf("%d%d%d%d%d", &n, &m, &k, &p, &q)
#define RFI(n) scanf("%lf", &n)
#define RFII(n, m) scanf("%lf%lf", &n, &m)
#define RFIII(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)
#define RFIV(n, m, k, p) scanf("%lf%lf%lf%lf", &n, &m, &k, &p)
#define RS(s) scanf("%s", s)
///OUTPUT
#define PN printf("\n")
#define PI(n) printf("%d\n", n)
#define PIS(n) printf("%d ", n)
#define PS(s) printf("%s\n", s)
#define PSS(s) printf("%s ", n)
#define PC(n) printf("Case %d: ", n)
///OTHER
#define PB(x) push_back(x)
#define CLR(a, b) memset(a, b, sizeof(a))
#define CPY(a, b) memcpy(a, b, sizeof(b))
#define display(A, n, m) {REP(i, n){REP(j, m)PIS(A[i][j]);PN;}}
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1

using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int MOD = 100000000;
const int INFI = 1e9 * 2;
const LL LINFI = 1e17;
const double eps = 1e-6;
const double pi = acos(-1.0);
const int N = 11111;
const int M = 15;
const int move[8][2] = {0, 1, 0, -1, 1, 0, -1, 0, 1, 1, 1, -1, -1, 1, -1, -1};

int a[M], pre[N], val[N], n, m;

void print(int x)
{
    if(pre[x])print(pre[x]);
    printf("%d", val[x]);
}

void bfs()
{
    queue<int> q;
    FF(i, 1, 10)if(!a[i])
    {
        if(i % n == 0)
        {
            PI(i);
            return;
        }
        q.push(i % n);
        pre[i] = 0;
        val[i] = i;
    }
    int p, x;
    while(!q.empty())
    {
        p = q.front();
        q.pop();
        REP(i, 10)if(!a[i])
        {
            x = (p * 10 + i) % n;
            if(!x)
            {
                print(p);
                PI(i);
                return;
            }
            if(pre[x] == -1)
            {
                pre[x] = p;
                val[x] = i;
                q.push(x);
            }
        }
    }
    puts("-1");
}

int main()
{
    //freopen("input.txt", "r", stdin);

    int cas = 1, t;
    while(RII(n, m) != EOF)
    {
        CLR(pre, -1);
        CLR(a, 0);
        REP(i, m)RI(t), a[t] = 1;
        PC(cas++);
        bfs();
    }
    return 0;
}