ACM試題Problem K:Ones
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?
標簽：
Description
divisible
Problem
integer
上傳時間：
2015-08-23
上傳用戶：zhenyushaw
