1881.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 1881 on 2005-09-23 at 21:41:37 */ 
#include <stdio.h>

int main()
{
    int visited[10001], i;
    long b, n;
    
    while(scanf("%ld", &b) == 1){
        n = 1;
        for(i = 0; i < 10001; i++) {
            visited[i] = 0;
        }
        for(i = 1; ; i++) {
            n %= b;
            if(n == 0) {
                printf("%d\n", i);
                break;    
            } else if(visited[n] || (i >= b)) {
                printf("0\n");
                break;
            } else {
                visited[n] = 1;
                n = 10 * n + 1;
            }
        }
    }
    
    return 0;
}