#2866. Problem E - Ones

    ID: 2866 传统题 1000ms 128MiB 尝试: 0 已通过: 0 难度: (无) 上传者: 标签>Waterloo数论模运算同余方程最小公倍数欧拉定理

Problem E - Ones

Problem E - Ones

题目描述

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