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
Output
Sample Input
3 7 9901
Sample Output
3 6 12
HINT
Source
最小能被几个1整除 111%3=0 111111%7=0
#include<stdio.h>
int main()
{
int n;
while(scanf("%d",&n)!=EOF&&n%2!=0&&n%5!=0)
{
long long int i=1,r,count=1;
r=i%n;
while(r!=0)
{
i=i*10+1;
r=i%n;
count++; //计数几个1
}
printf("%lld\n",count);
}
return 0;
}