题目描述
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?
输入
暂无
输出
暂无
样例输入
3
7
9901
样例输出
3
6
12
参考代码
#include <stdio.h>
main()
{
int n,rem,digs;
while (1 == scanf("%d",&n))
{
for (rem=digs=1;rem;digs++) rem = (rem*10+1) % n;
printf("%dn",digs);
}
}
解析
暂无