本文探讨了如何找出能够被特定整数n整除的、由连续1组成的最小数的位数。输入为整数n（0 < n ≤ 10000且不被2或5整除），输出该数的位数。通过迭代计算，每次将当前值乘以10加1，直到找到能被n整除的数为止。
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
KEY:给定一个n，看几个连续的1可以整除他；
Source:#include<iostream> using namespace std; int main() 
...{ 
unsigned n, t, T; while(cin>>n) 
...{ t=T=1; t%=n; while(t) ...{ t=t*10+1; T++; t%=n; 
} cout<<T<<endl; } return 0; 
}
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
