<pre name="code" class="cpp"><p style="line-height: 28px; margin-top: 0px; margin-bottom: 10px; padding-top: 0px; padding-bottom: 0px; font-family: 'Hiragino Sans GB W3', 'Hiragino Sans GB', Arial, Helvetica, simsun, u5b8bu4f53; font-size: 16px;"> 任意给定一个正整数N,求一个最小的正整数M(M >1),使得N * M 的十进制表示形式里只含有1 和0,例如:</p><blockquote style="line-height: 28px; font-size: 16px; margin: auto 0px auto 35px; font-family: 'Hiragino Sans GB W3', 'Hiragino Sans GB', Arial, Helvetica, simsun, u5b8bu4f53;"><p style="margin-top: 0px; margin-bottom: 10px; padding-top: 0px; padding-bottom: 0px;">1 * 1 = 1 2 * 5 = 10
3 * 37 = 111 4 * 25 = 100
5 * 2 = 10 6 * 185 = 1,110
7 * 143 = 1,001 8 * 125 = 1,000
9 * 12,345,679 = 111,111,111</p></blockquote>
<img src="https://img-blog.csdn.net/20141211112902716?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQveXVoYW5fOTIwNA==/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" />
#include<vector>
#include<iostream>
#include<cmath>
using namespace std;
const int N=6;
void search(){
vector<vector<int>> v;
vector<int> temp;
temp.clear();
int i,j,k;
double number=0;
for(i=0;i<N;i++)
{
v.push_back(temp);
}
v[1].push_back(0);
int NoUpdate=0;
for(i=1,j=10%N;;i++,j=(j*10)%N)
{
bool flag=false;
if(v[j].empty())
{
flag=true;
v[j].push_back(i);//v[j]代表的整数为10^i,10^i%N=j
}
// i=1 2 3 j=4 k =1 4,5 2 //v[4]:{1} v[1]:{0}
for(k=1;k<N;k++)
{
if( (!v[k].empty())&& (i>v[k][v[k].size()-1]) &&
(v[(k+4)%6].empty()) ) //出现新的余数
{
flag=true;
v[(k+j)%N]=v[k]; // v[5]:v[1]{0} v[2]:v[4]{1} v[3]:v[5]{0,1} v[0]:v[2]{1,2}
v[(k+j)%N].push_back(i); // v[5]:{0,1} v[2]:{1,2} v[3]:{0,1,2} v[0]={1,2,3}
}
}
if(!flag)
NoUpdate++; //未更新
else
NoUpdate=0;
//如果经过一个循环节都没能对BigInt进行更新,就是无解
//如果v[0].empty不为空,已经找到解
if(NoUpdate==N||(!v[0].empty()))
break;
}
if(v[0].empty())
cout<<"No number matched the condition is found"<<endl;
else{
vector<int> ::iterator iter;
for(iter=v[0].begin();iter!=v[0].end();iter++){
number+=pow(10.0,*iter);
}
//cout<<"the number is "<<number<<endl;
}
}
int main(){
search();
system("pause");
}