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?
Sample Input
3
7
9901
Output for Sample Input
3
6
12
code
1 #include <iostream>
2
3 using namespace std;
4
5 int main()
6 {
7 int n,temp;
8 int a=
1,bits=
1;
9 while(cin>>
n)
10 {
11 a=
1;bits=
1;
12 while(
1)
13 {
14 temp=a%
n;
15 if(temp==
0)
16 {
17 cout<<bits<<
endl;
18 break;
19 }
20 else
21 {
22 a=temp*
10+
1;
23 bits++
;
24 }
25 }
26 }
27 return 0;
28 }
转载于:https://www.cnblogs.com/QuentinYo/archive/2013/03/31/2991921.html
相关资源：JAVA上百实例源码以及开源项目
