int n;
bool fg;
void dfs(ull now, int k)
{
if (fg)return;
if (k == 20)return;
if (now%n == 0) { fg = 1;cout << now << endl;return; }
dfs(now * 10, k + 1);
dfs(now * 10 + 1, k + 1);
return;
}
int main()
{
while (cin >> n)
{
if (n == 0)break;
fg = false;
dfs(1,1);
}
return 0;
}
Find The Multiple POJ - 1426
最新推荐文章于 2022-02-19 09:15:00 发布