1．鏈接地址

https://vjudge.net/problem/POJ-2551

2．問題描述

?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

3．解題思路

?題意即存在一個只由1組成的數，可以整除給出的n。注意不要超出位數

4．算法實現源代碼

#include<cstdio> #include<cstdlib> #include<iostream> using namespace std; int main() {int i,j,n;bool f;int s,t=0;while(scanf("%d",&n)!=EOF){f=false;t=s=1;t=t%n;while(t!=0){t=(t*10%n+1)%n;s++;}printf("%d\n",s);}return 0; }

?

轉載于:https://www.cnblogs.com/KasenBob/p/11176926.html

總結

以上是生活随笔為你收集整理的poj2551的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。