day6 POJ 1426 Find The Multiple
2016-08-02 23:37
337 查看
从1开始BFS 找答案即可,每次搜索后都对结果进行模处理,对最终结果不会有影响,而实际这道题数据比较小,开longlong直接dfs也能过
#include"iostream"
using namespace std;
int n,flag;
void DFS(unsigned long long x,int sum)
{
if(flag||sum==19)
{
return ;
}
if(x%n==0)
{
cout<<x<<endl;
flag=1;
return ;
}
else
{
DFS(x*10,sum+1);
DFS(x*10+1,sum+1);
}
return ;
}
int main()
{
while(cin>>n)
{
if(n==0) break;
flag=0;
DFS(1,0);
}
return 0;
}
#include"iostream"
using namespace std;
int n,flag;
void DFS(unsigned long long x,int sum)
{
if(flag||sum==19)
{
return ;
}
if(x%n==0)
{
cout<<x<<endl;
flag=1;
return ;
}
else
{
DFS(x*10,sum+1);
DFS(x*10+1,sum+1);
}
return ;
}
int main()
{
while(cin>>n)
{
if(n==0) break;
flag=0;
DFS(1,0);
}
return 0;
}
相关文章推荐
- POJ 1426, Find The Multiple
- poj 1426 Find The Multiple
- POJ1426-Find The Multiple
- POJ-1426 Find The Multiple
- POJ 1426 Find The Multiple(打表)
- POJ1426 Find The Multiple
- POJ1426 Find The Multiple 解题报告
- poj 1426 Find The Multiple
- POJ 1426 Find The Multiple (附模运算公式)
- Poj 1426 Find The Multiple
- POJ1426,Find The Multiple,bfs...注意类型 5兆内存过了...
- POJ 1426 Find The Multiple
- POJ1426-Find The Multiple
- POJ 1426 Find the Multiple
- POJ_1426_Find The Multiple
- POJ 1426 Find The Multiple
- poj -- 1426 Find The Multiple (搜索)
- POJ 1426 Find The Multiple
- POJ 1426 Find The Multiple
- poj 1426 Find The Multiple (广搜)