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?
| Time Limit | $1$ 秒/Second(s) | Memory Limit | $512$ 兆字节/Megabyte(s) |
| 提交总数 | $3$ | 正确数量 | $3$ | "
| 裁判形式 | 标准裁判/Standard Judge | 我的状态 | 尚未尝试 |
| 难度 | 分类标签 |
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
| 本题记录 | 用 户（点击查看用户） | 运行号（点击购买题解） | 时 间 |
|---|---|---|---|
| 算法最快[$0 $ms] | AOJ大管家 | 84447 | 2017-04-27 15:29:55 |
| 内存最少[$944 $KB] | AOJ大管家 | 84447 | 2017-04-27 15:29:55 |
| 第一AC | AOJ大管家 | 84447 | 2017-04-27 15:29:55 |
| 第一挑战 | AOJ大管家 | 84447 | 2017-04-27 15:29:55 |
| 竞赛编号 | 竞赛名称 | 竞赛时间 | 访问比赛 |
|---|