poj1426——Find The Multiple
2010-12-04 11:27
309 查看
擦,有点纸老虎的味道!滚动数组实现:
#include<stdio.h> #include<string.h> __int64 queue[10000000],n; void solve() { int i,front=0,rear=0; queue[++rear]=1; __int64 t; while(front!=rear) { front=(front+1)%10000000; t=queue[front]; if(t%n==0) { printf("%I64d/n",t); return ; } rear=(rear+1)%10000000; queue[rear]=t*10; rear=(rear+1)%10000000; queue[rear]=t*10+1; } } int main() { int i; while(scanf("%I64d",&n)!=EOF) { if(n==0) break; solve(); } return 0; }
相关文章推荐
- poj1426 Find The Multiple
- POJ 1426, Find The Multiple
- POJ - 1426 Find The Multiple
- Find The Multiple POJ - 1426
- poj1426——Find The Multiple(BFS)
- poj 1426 Find The Multiple (广搜)
- POJ1426 - Find The Multiple
- poj 1426 Find The Multiple( bfs )
- POJ ~ 1426 ~ Find The Multiple(DFS)
- POJ - 1426 Find The Multiple(暴力)
- poj 1426 Find The Multiple(dfs || 二进制枚举)
- POJ 1426 Find The Multiple(BFS 同余模定理)
- POJ1426-Find The Multiple-深度优先搜索BFS
- POJ 1426 Find The Multiple
- POJ 1426-Find The Multiple
- AYIT2017暑假集训第二周周三赛 A - Find The Multiple POJ - 1426
- POJ 1426 Find The Multiple
- Find The Multiple(poj 1426)
- poj 1426 Find The Multiple
- POJ 1426.Find The Multiple