POJ - 1426 - Find The Multiple (DFS)
2015-05-25 00:09
148 查看
题目传送:Find The Multiple
思路:DFS
AC代码:
思路:DFS
AC代码:
#include <map> #include <set> #include <cmath> #include <deque> #include <queue> #include <stack> #include <cstdio> #include <cctype> #include <string> #include <vector> #include <cstdlib> #include <cstring> #include <iostream> #include <algorithm> #define LL long long #define ULL unsigned long long #define INF 0x7fffffff using namespace std; int dfs(ULL pre, ULL x, ULL n) { if(pre > x) return 0;//判断是否溢出,溢出了就不是正解 if(x % n == 0) { cout << x << endl; return 1; } if(dfs(x, x * 10, n)) return 1; return dfs(x, x * 10 + 1, n); } int main() { int n; while(scanf("%d", &n) != EOF) { if(n == 0) break; dfs(0, 1, n); } return 0; }
相关文章推荐
- 【DFS】poj 1426 Find The Multiple
- POJ 1426 Find The Multiple (DFS)
- poj 1426 Find The Multiple(DFS或打表)
- POJ 1426 Find The Multiple(dfs)
- 文章标题 POJ 1426 :Find The Multiple (dfs)
- POJ-1426-Find The Multiple (BFS +DFS)两种解法
- D - Find The Multiple POJ - 1426 ——DFS || BFS
- poj 1426 Find The Multiple dfs
- POJ 1426 Find The Multiple(dfs)
- POJ 1426 Find The Multiple(DFS构造)
- POJ 1426 Find The Multiple DFS
- POJ_1426 Find The Multiple(dfs)
- POJ 1426 Find The Multiple (dfs)
- Poj 1426 Find The Multiple 【DFS】
- POJ 1426 Find The Multiple --- BFS || DFS
- Poj 1426--Find The Multiple(bfs或dfs)
- poj 1426 Find The Multiple(dfs || 二进制枚举)
- poj 1426 Find The Multiple ( dfs )
- POJ 1426 Find The Multiple(dfs)
- POJ-1426-Find The Multiple(BFS DFS)