这道题可以直接将值除出来就可以了,如果出现了余数相同就表示出现循环数了,
输出的时候需要注意一下。
#include <stdio.h>
#include <string.h>
#define clr( a ) memset ( a, 0, sizeof ( a ) )
const int maxn = 3005;
int ans[maxn], vis[maxn], s[maxn];
int main ( )
{
int n, m, cnt;
while ( ~ scanf ( "%d%d", &n, &m ) )
{
clr ( vis ); //vis标记每个数字出现在ans的位置
clr ( s ); //保存上一个数的值
cnt = 0;
printf ( "%d/%d = %d.", n, m, n/m );
ans[cnt ++] = n/m; //保存除出来的值
n = n%m;
while ( n && vis[n] == 0 ) //余数为或余数前面出现过
{
vis[n] = cnt; //标记n出现的位置
s[cnt] = n; //保存ans[cnt]由n除出来的
ans[cnt ++] = 10*n/m;
n = n*10%m;
}
for ( int i = 1; i < cnt && i <= 50; i ++ )
{
if ( n && s[i] == n ) //当s[i]==n即循环的位置
printf ( "(" );
printf ( "%d", ans[i] );
}
if ( n == 0 )
printf ( "(0" );
if ( cnt > 50 )
printf ( "..." );
printf ( ")\n" );
printf ( " %d = number of digits in repeating cycle\n", n == 0 ? 1 : cnt-vis[n] );
//当n == 0时需要考虑,1/250时,长度是1
printf ( "\n" );
}
return 0;
}