这题通过团友以及百度的翻译,同时还参照了 http://blog.csdn.net/yming0221/article/details/6370117 意思基本上清楚了:输入一个不能被2或者5的数,输出这个数的倍数的最小位数,这个倍数全部由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?
输入
Each line contains a number n.
输出
Output the number of digits.
样例输入
3
7
9901
7
9901
样例输出
3
6
12
6
12
#include<iostream> using namespace std; int fun(int n)//按常规的方法肯定会超时,在这里我们可以用mod的方法进行计算 { int c=0,m=n; while(n) { n=n*10+1; c++; n%=m; } return c; } int main() { int n; while(cin>>n) { cout<<fun(n)<<endl; } return 0; }