poj 1426 Find The Multiple
2010-07-16 17:26
519 查看
http://162.105.81.212/JudgeOnline/problem?id=1426
Discuss里多说用bfs+状态压缩,
看了半天也没看出来(就是不会,囧)
只好暴力枚举-_-,62MS
ps: 知道这题用bfs怎么解的留个言啊..TU
Discuss里多说用bfs+状态压缩,
看了半天也没看出来(就是不会,囧)
只好暴力枚举-_-,62MS
#include<stdio.h> __int64 a[1500000]; int main() { int n,t1,t2; while(scanf("%d",&n),n) { t1=0; t2=1; a[0]=1; while(1) { if(a[t1]%n==0) { printf("%I64d/n", a[t1]); break; } else { a[t2++]=a[t1]*10; a[t2++]=a[t1]*10+1; t1++; } } } return 0; }
ps: 知道这题用bfs怎么解的留个言啊..TU
相关文章推荐
- POJ 1426 Find The Multiple
- poj1426 Find The Multiple
- POJ1426 Find The Multiple
- poj - 1426-Find The Multiple-BFS
- POJ 1426 Find The Multiple
- poj 1426 Find The Multiple (广搜)
- POJ 1426 Find The Multiple (BFS + 同余定理)
- POJ-1426--Find The Multiple---BFS广搜
- POJ1426 Find The Multiple(bfs)
- POJ 1426 Find the Multiple
- POJ 1426 Find The Multiple(打表)
- POJ 1426 Find The Multiple (DFS)
- POJ 1426 Find The Multiple
- poj 1426 Find The Multiple
- POJ 1426 Find The Multiple DFS
- POJ - 1426 Find The Multiple (暴力DFS)
- POJ 1426 Find The Multiple (广搜)
- Poj 1426 Find The Multiple 【DFS】
- POJ-1426-Find The Multiple (BFS +DFS)两种解法
- POJ 1426 Find The Multiple (搜索)