how many ones?

how many ones?

时间限制： 3000 ms  |  内存限制： 65535 KB

难度： 2

描述

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?

输入

Each line contains a number n.

输出

Output the number of digits.

样例输入

3 
7 
9901

样例输出

3
6
12

Given any integer 0 <= n <= 10000 not divisible by 2 or 5

 给你一个不能被2或者5整出 数n，some multiple of n is a number which in decimal notation is a sequence of 1's. 

 这个n变化多少次可以变为由1组成的十进制数

 反过来想：这个数可被由多少个1组成的数整除
#include<stdio.h>
int main()
{
    int n;
    while(scanf("%d",&n)!=-1)
    {
        int sum=0,p=0;
        for(;;)
        {
            p++;
            sum=(sum*10+1)%n;//n要放在这取余，放在下边取余会超时，因为sum取余后在下一步会变小，就不会超时
            if(sum==0)
            {
                break;
            }
        }
        printf("%d\n",p);
    }
}