POJ1426--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 corre…

Find The Multiple Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 24768   Accepted: 10201   Special Judge Description Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains…

Find The Multiple Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 14622   Accepted: 5938   Special Judge Description Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains…

Find The Multiple Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 36335   Accepted: 15194   Special Judge Description Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains…

http://poj.org/problem?id=1426 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 c…

题目链接:http://poj.org/problem?id=1426 Find The Multiple Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 34218   Accepted: 14337   Special Judge Description Given a positive integer n, write a program to find out a nonzero multiple m of n w…

题目: Find The Multiple Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 41845   Accepted: 17564   Special Judge Description Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation cont…

参考:http://www.cnblogs.com/ACShiryu/archive/2011/07/24/2115356.html #include <iostream> #include <cstdio> #include <cstring> #include <queue> using namespace std; int main() { int n; while (cin>>n,n) { queue<long long> q…

传送门 转:http://blog.csdn.net/wangjian8006/article/details/7460523 (比较好的记录路径方案) #include<iostream> #include<cstring> #include<cstdlib> #include<cstdio> #include<algorithm> #include<cmath> #include<queue> #include<…

题意: 给一个数n,让你找出一个只有1,0,组成的十进制数,要求是找到的数可以被n整除. 用DFS是搜索 当前位数字 (除最高位固定为1),因为每一位都只有0或1两种选择,换而言之是一个双入口BFS. 用DFS也可用queue代替BFS也可. #include<iostream> #include<cstdlib> #include<cstdio> #include<cstring> #include<queue> #include<alg…