Ones
Time Limit: 1000MS | Memory Limit: 65536K |
Total Submissions: 5098 | Accepted: 2912 |
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
Source
'PKU & UVa problems > Original problem' 카테고리의 다른 글
PKU 2719. Faulty Odometer (0) | 2009.02.16 |
---|---|
UVa 200. Rare Order (0) | 2009.02.07 |
PKU 1904. King's Quest (2) | 2009.01.15 |
PKU 1953. World Cup Noise (0) | 2009.01.09 |
PKU 2845. 01000001 (0) | 2009.01.02 |