POJ1426(BFS)

最新推荐文章于 2025-08-08 16:16:05 发布

原创最新推荐文章于 2025-08-08 16:16:05 发布 · 679 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

POJ

该博客介绍了如何利用广度优先搜索（BFS）策略来解决POJ1426问题，即寻找一个由0和1组成的非零数字，该数字能被给定的正整数n整除。博客内容包括题目描述、解题思路和Java代码实现。虽然提供的Java代码遇到了内存超出限制的问题，但博客仍能为读者提供解决问题的思路。

POJ1426(BFS)

Find The Multiple

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

Sample Output

10
100100100100100100
111111111111111111

题意

给一个数n，让你找出一个只有1，0，组成的十进制数，要求是找到的数可以被n整除。

思路

用BFS是搜索当前位数字（除最高位固定为1），因为每一位都只有0或1两种选择.

Java代码内存超出限制。。。

代码

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class FindTheMultiple {

    Queue<Long> queue = new LinkedList<Long>();

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) {
                break;
            }
            FindTheMultiple findTheMultiple = new FindTheMultiple();
            long result = findTheMultiple.bfs(n);
            System.out.println(result);

        }
    }

    public long bfs(int n) {
        queue.add(1l);
        if (1l % n == 0) {
            return 1l;
        }
        while (true) {
            long num = queue.remove();

            if ((num * 10) % n == 0) {
                return num * 10;
            }
            queue.add(num * 10);
            if ((num * 10 + 1) % n == 0) {
                return num * 10 + 1;
            }
            queue.add(num * 10 + 1);
        }
    }
}

#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
typedef long long LL;
void bfs(int n)
{
  queue<long long>que;
  que.push(1);
  while (!que.empty())
  {
    long long now=que.front();
    if (now%n!=0)
    {
      que.push(now*10);
      que.push(now*10+1);          
    }
    else {cout<<now<<endl;return;}
    que.pop();    
  }
}
int main()
{
  int n;
  while (scanf("%d",&n)==1&&n)
  {
    bfs(n);
  }
  return 0;
}