问题1233--Problem E - Ones

1233: Problem E - Ones

时间限制: 1 Sec  内存限制: 128 MB
提交: 1  解决: 1
[提交] [状态] [讨论版] [命题人:]

题目描述

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

来源/分类

 

[提交] [状态]