同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

21146_Ones

2022-5-16 18:18| 发布者: Hocassian| 查看: 27| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-3-89504927585899-Problem List-采集的数据-后羿采集器.html

Pro.ID

21146

Title

Ones

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=21146

AC

Submit

101

Ratio

51.49%

时间&空间限制

Time Limit: 2000/200 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

描述

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?

输入

Mutiple test case, one integer per line.

输出

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

Mutiple test case, one integer per line.

Output

For each test case, output the result in a line.

Sample Input

3
7
9901

Sample Output

3
6
12