Problem E - Ones
时间: 1ms 内存:128M
描述:
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
提示:
参考答案:
解锁文章
文章评论