H-找出n的倍数只能由0和1构成

最新推荐文章于 2021-08-25 11:04:44 发布

胖亚亚

最新推荐文章于 2021-08-25 11:04:44 发布

阅读量1k

点赞数

分类专栏：搜索方向练习

本文链接：https://blog.csdn.net/qq_37748451/article/details/71699175

版权

这是一个编程问题，目标是找到一个非零的整数m，它是n的倍数，且m的十进制表示仅包含0和1。通过深度优先搜索策略，从1开始，分别尝试乘以10和10+1，检查是否是n的倍数，直至找到符合条件的m。代码中展示了C++实现的解决方案。

摘要由CSDN通过智能技术生成

Description

Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 200 and there is a corresponding m containing no more than 100 decimal digits.

Input

The input file may contain multiple test cases. Each line contains a value of n (1 <= n <= 200). A line containing a zero terminates the input.

Output

For each value of n in the input print a line containing the corresponding value of m. The decimal representation of m must not contain more than 100 digits. If there are multiple solutions for a given value of n, any one of them is acceptable.

Sample Input