poj 1426 Find The Multiple (bfs 搜索）

最新推荐文章于 2021-02-04 19:47:21 发布

HJ_彼岸

最新推荐文章于 2021-02-04 19:47:21 发布

阅读量1.5k

点赞数 1

分类专栏： poj 搜索 ACM刷题录文章标签： acm poj 搜索 bfs

本文链接：https://blog.csdn.net/whjkm/article/details/38420843

版权

该博客详细介绍了POJ 1426问题的解决方案，主要使用BFS搜索算法。内容包括题目的描述、输入输出格式、样例输入输出，并引用了PL大牛的分析思路，强调通过余数表示状态并进行宽度优先搜索，最多处理200个状态即可找到答案。博主鼓励读者多学习优秀代码。

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

Find The Multiple

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 18012		Accepted: 7297		Special Judge

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