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
2 6 19 0
Sample Output
10 100100100100100100 111111111111111111
这题方法比较多,就多写了一种;
题解1:所有数都可以在 long long 范围内求解,故可直接写;
#include <iostream>
using namespace std;
typedef long long LL;
int n, f;
void dfs(LL x,int ans)
{
if(f) return;
if(x%n==0)
{
cout<<x<<endl;
f=1;
return;
}
if(ans>=19) return;
dfs(x*10,ans+1);
dfs(x*10+1,ans+1);
}
int main()
{
while(cin>>n && n)
{
f=0;
dfs(1,1);
}
return 0;
}
题解2:跟解法一差不错,只不过利用了一下哈夫曼思想,代码更简单了;
#include <iostream>
using namespace std;
typedef long long LL;
LL a[600001];
int main()
{
int n;
while(cin>>n && n)
{
for(int i=1; ;i++)
{
a[i]=a[i/2]*10+i%2;
if(a[i]%n==0)
{
cout<<a[i]<<endl;
break;
}
}
}
return 0;
}