题目链接 http://www.51nod.com/Challenge/Problem.html#!#problemId=1109
思路
广搜,
首先将1入队列,然后后面就是 + 0 或者 + 1;
将余数标记,因为余数相同就不会是最小的(这步相当于剪枝)
#pragma GCC optimize(2)
#include <iostream>
#include <queue>
using namespace std;
typedef unsigned long long ll;
typedef long double ld;
const ll maxn = 1e6 + 5;
const ll mod = 998244353;
// flag标记余数的数组
ll n,flag[maxn];
struct node{
string s;
ll mod;
node(string ss,ll mo){
s = ss;
mod = mo;
}
};
void bfs()
{
queue<node>q;
q.push(node("1",1 % n));
while(!q.empty())
{
node k = q.front();
q.pop();
if(k.mod == 0)//余数为0输出答案
{
cout << k.s << endl;
return ;
}
char c1 = '0';
char c2 = '1';
string s = k.s + c1;
//按照0 1顺序加这样搜出来是最小的
if(flag[k.mod * 10 % n] == 0)
{
flag[k.mod * 10 % n] = 1;
q.push(node(s,k.mod * 10 % n));
}
s = k.s + c2;
if(flag[(k.mod * 10 % n + 1) % n] == 0)
{
flag[(k.mod * 10 % n + 1) % mod] = 1;
q.push(node(s,(k.mod * 10 % n + 1) % n));
}
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
cin >> n;
bfs();
return 0;
}