POJ1426 Find The Multiple（非bfs解题，暴力过法）

Find The Multiple

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.

大致题意

给出一个整数n，(1 <= n <= 200)。求出任意一个它的倍数m，要求m必须只由十进制的’0’或’1’组成。

解题思路
不利用搜索的方式来解题，而是改用暴力枚举，但是不能像正常那样来枚举，注意到题目要求数字必须由0，1组成，而二进制的数字也完全是由0，1组成的，利用函数将数字转化为二进制，这样再次进行枚举就会简单很多。

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include<vector>
#include<queue>
#include<set>
using namespace std;
typedef long long LL;
LL f(int n){
	LL sum=0;
	int i=0;
	int a[32];
	while((n/2)!=0)//将十进制数不断除2取余数，直到最后除2等于0，循环结束
	{
		a[i]=n%2;//将十进制数除2后的余数存放在数组中
		i++;
		n/=2;//不断改变x的值	
	}
	a[i]=n;
	for(int j=i;j>=0;j--)//当转成二进制数输出时，需要将数组中的数倒着输出
	sum=sum*10+a[j];
	return sum;
} 
int main(){
	while(1){
		int n;cin>>n;
		if(n==0)break;
		for(int i=1;;i++){
			if(f(i)%n==0){
				cout<<f(i)<<endl;
				break;
			}
		}
	}
    return 0;
}