poj 2551 Ones£¨Í¬Óࣩ

Ones

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 11459		Accepted: 6487

Description

Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple of n is a number which in decimal notation is a sequence of 1's. How many digits are in the smallest such a multiple of n?

Input

Each line contains a number n.

Output

Output the number of digits.

Sample Input

3 
7 
9901

Sample Output

3
6
12

ÌâÒâ：ÇónµÄÒ»¸ö±¶Êý¶¼ÓÉ1×é³É，²¢ÇÒÊä³ö×îСµÄÕâ¸ö±¶ÊýµÄλÊý

˼·：ÀûÓÃͬÓඨÀí，±ß¼Ó1±ßÈ¡Ä£¼´¿É，µÚÒ»¸öģΪ0¼´ÊÇ´ð°¸

´úÂë：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        int sum=0;
        for(int i=1;i<=n;i++)
        {
            sum=(sum*10+1)%n;
            if(!sum)
            {
                printf("%d\n",i);
                break;
            }
        }
    }
    return 0;
}