UVA—202

问题描述：

The decimal expansion of the fraction 1/33 is 0.03, where the 03 is used to indicate that the cycle 03
repeats indefinitely with no intervening digits. In fact, the decimal expansion of every rational number
(fraction) has a repeating cycle as opposed to decimal expansions of irrational numbers, which have no
such repeating cycles.
Examples of decimal expansions of rational numbers and their repeating cycles are shown below.
Here, we use parentheses to enclose the repeating cycle rather than place a bar over the cycle.
fraction decimal expansion repeating cycle cycle length
1/6 0.1(6) 6 1
5/7 0.(714285) 714285 6
1/250 0.004(0) 0 1
300/31 9.(677419354838709) 677419354838709 15
655/990 0.6(61) 61 2
Write a program that reads numerators and denominators of fractions and determines their repeating
cycles.
For the purposes of this problem, define a repeating cycle of a fraction to be the first minimal length
string of digits to the right of the decimal that repeats indefinitely with no intervening digits. Thus
for example, the repeating cycle of the fraction 1/250 is 0, which begins at position 4 (as opposed to 0
which begins at positions 1 or 2 and as opposed to 00 which begins at positions 1 or 4).
Input
Each line of the input file consists of an integer numerator, which is nonnegative, followed by an integer
denominator, which is positive. None of the input integers exceeds 3000. End-of-file indicates the end
of input.
Output
For each line of input, print the fraction, its decimal expansion through the first occurrence of the cycle
to the right of the decimal or 50 decimal places (whichever comes first), and the length of the entire
repeating cycle.
In writing the decimal expansion, enclose the repeating cycle in parentheses when possible. If the
entire repeating cycle does not occur within the first 50 places, place a left parenthesis where the cycle
begins — it will begin within the first 50 places — and place ‘...)’ after the 50th digit.
Sample Input
76 25
5 43
1 397
Sample Output
76/25 = 3.04(0)
1 = number of digits in repeating cycle
5/43 = 0.(116279069767441860465)
21 = number of digits in repeating cycle
1/397 = 0.(00251889168765743073047858942065491183879093198992...)
99 = number of digits in repeating cycle

解决方案：

#include <iostream>
#include <cstdio>
#include <cstring>
bool isSame(int*arr,int begin,int n,int*position)
{
    for(int i = begin; i < n; i++)
        for(int j = 0; j < i;j++){
            if(arr[j] == arr[i]){
                position[0] = j;
                position[1] = i;
                return true;
            }
        }
    return false;
}

int main()
{
    int result[3050];
    int dividend[3050];
    int a,b;
    while(scanf("%d",&a) != EOF){
        scanf("%d",&b);
        int integer = a / b;
        int begin = 0;
        int numlen = 0;
        int position[2] = {0};
        dividend[0] = a - integer * b;
        while(true){
            for(int i = 0; i < 20;i++){
                result[numlen] = dividend[numlen] * 10 / b;
                dividend[numlen + 1] = dividend[numlen] * 10 - result[numlen] * b;
                numlen++;
            }
            if(isSame(dividend,begin,numlen,position))
                break;
            begin = numlen + 1;

        }
        printf("%d/%d = %d.",a,b,integer);
        for(int i = 0; i < position[0]; i++)
            printf("%d",result[i]);
        printf("(");
        int min = (50 < position[1])?50:position[1];
        for(int i = position[0]; i < min; i++)
            printf("%d",result[i]);
        if(min != position[1])
            printf("...");
        printf(")\n");
        printf("   %d = number of digits in repeating cycle",position[1] - position[0]);
        printf("\n\n");
    }
    return 0;
}

思路：循环长度不超过分母，因为余数总是小于分母，当检查到余数出现重复时，即得到循环长度（检查商的重复的复杂性较高）