輸入1個數N。(1 <= N <= 10^6)Output
輸出符合條件的最小的M。Input示例
4Output示例
100
代碼：
#include<cstdio>#include<vector>#include<queue>#include<cstring>#include<algorithm>using namespace std;bool yu[1000100];struct node{    vector<char> ch;    int shu;}now,qian;int main(){    int n;    scanf("%d",&n);    if(n==1)        PRintf("1/n");    else    {        queue<node> que;        now.shu=1;        now.ch.push_back('1');        que.push(now);        int a,b;yu[1]=true;        bool fafe=false;        while (true)        {            now=que.front();            que.pop();            a=now.shu*10;            for (int i=0;i<2;i++)            {                b=(a+i)%n;                if (b==0)                {                    for (int i=0;i<now.ch.size();i++)                        printf("%c",now.ch[i]);                    printf("%d/n",i);                    fafe=true;                    break;                }                if (yu[b]) continue;                yu[b]=true;                qian.ch=now.ch;                qian.ch.push_back(i+48);                qian.shu=b;                que.push(qian);            }            if (fafe) break;        }    }    return 0;}