内存:64  时间: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?

输入

A file of integers at one integer per line.

输出

Each output line gives the smallest integer x > 0 such that p = 1 x 10i, where a is the corresponding input integer, p = a x b, and b is an integer greater than zero.

样例输入

3
7
9901

样例输出

3
6
12

提示

代码如下

#include <iostream> 
using namespace std; 
int main() 
{    
    int n; 
    while(cin>>n) 
    { 
        int count=1; 
        int s=1; 
        while(s%n!=0) 
        {    
            s*=10; 
            s=s%n+1; 
            count++; 
            if(s==n)break; 
        } 
        cout<<count<<endl; 
    } 
    return 0; 
} 

代码来源于互联网,仅供参考!