poj1426——Find The Multiple

擦，有点纸老虎的味道！滚动数组实现：

#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; }