#include <iostream>
#include <cstdio>
using namespace std;
int n;
long long q[9999999];
void bfs()
{
int front,rear;
front=rear=0;
q[rear]=1;
rear++;
long long top;
while(rear>front)
{
top=q[front];
if(top%n==0) break;
top*=10;
q[rear++]=top;
q[rear++]=top+1;
front++;
}
printf("%lld\n",top);
}
int main()
{
int t;
while(scanf("%d",&n)&&n)
{
bfs();
}
return 0;
}
poj1426
最新推荐文章于 2018-07-26 19:56:33 发布