【模拟】【USACO】Fractions to Decimals

Write a program that will accept a fraction of the form N/D, where N is the numerator and D is the denominator and print the decimal representation. If the decimal representation has a repeating sequence of digits, indicate the sequence by enclosing it in brackets. For example, 1/3 = .33333333...is denoted as 0.(3), and 41/333 = 0.123123123...is denoted as 0.(123). Use xxx.0 to denote an integer. Typical conversions are:

1/3     =  0.(3)
22/5    =  4.4
1/7     =  0.(142857)
2/2     =  1.0
3/8     =  0.375
45/56   =  0.803(571428)

PROGRAM NAME: fracdec

INPUT FORMAT

A single line with two space separated integers, N and D, 1 <= N,D <= 100000.

SAMPLE INPUT (file fracdec.in)

45 56

OUTPUT FORMAT

The decimal expansion, as detailed above. If the expansion exceeds 76 characters in length, print it on multiple lines with 76 characters per line.

SAMPLE OUTPUT (file fracdec.out)

0.803(571428)

描述

写一个程序，输入一个形如N/D的分数(N是分子，D是分母)，输出它的小数形式。 如果小数有循环节的话，把循环节放在一对圆括号中。

例如, 1/3 =0.33333333　写成0.(3), 41/333 = 0.123123123...　写成0.(123), 用xxx.0 等表示整数。 典型的转化例子：

1/3 = 0.(3)
22/5 = 4.4
1/7 = 0.(142857)
2/2 = 1.0
3/8 = 0.375
45/56 = 0.803(571428)

[编辑]PROGRAM NAME

fracdec

[编辑]INPUT FORMAT

单独的一行包括被空格分开的N和D(1 <= N,D <= 100000)。

[编辑]SAMPLE INPUT

(file fracdec.in)

45 56

[编辑]OUTPUT FORMAT

按照上面规则计算出的小数表达式.如果结果长度大于76,每行输出76个字符.

 

[编辑]SAMPLE OUTPUT

(file fracdec.out)

0.803(571428)

模拟除法的过程，只有当余数和商都相等的时候，才能判断出现了一个循环节。

/*
  ID:sephiro5
  LANG:C++
  PROG:fracdec
*/
#include <stdio.h>
#define maxn 100000

int a[maxn],b[maxn];
int zheng,len,tot,zlen;
int x,y,l,r,step;
bool ok;
bool c[10][maxn];

int main()
{
    freopen("fracdec.in","r",stdin);
    freopen("fracdec.out","w",stdout);
    
    scanf("%d%d",&x,&y);
    zheng=x/y;
    int tem=zheng;
    while (tem!=0)
    {
        ++zlen;
        tem/=10;
    }
    if (!zheng) zlen=1;
    x=x%y;
    if (!x)
    {
        printf("%d.0/n",zheng);
        return 0;
    }
    while (1)
    {
        ++tot;
        x*=10;
        a[tot]=x/y;
        b[tot]=x%y;
        x=x%y;
        if (c[a[tot]][b[tot]])
            for (int i=1;i<tot;++i)
                if ((a[i]==a[tot])&&(b[i]==b[tot]))
                {
                    l=i;
                    r=tot-1;
                    ok=1;
                    break;
                }
        c[a[tot]][b[tot]]=1;
        if (ok) break;
        if (b[tot]==0) break;
    }
    if (!l)
    {
        printf("%d.",zheng);
        step=zlen+1;
        for (int i=1;i<=tot;++i)
        {
            ++step;
            printf("%d",a[i]);
            if (step%76==0) printf("/n");
        }
        printf("/n");
        return 0;
    }
    else
    {
        printf("%d.",zheng);
        step=zlen+1;
        for (int i=1;i<l;++i)
        {
            ++step;
            printf("%d",a[i]);
            if (step%76==0) printf("/n");
        }
        printf("(");
        ++step;
        if (step%76==0) printf("/n");
        for (int i=l;i<=r;++i)
        {
            ++step;
            printf("%d",a[i]);
            if (step%76==0) printf("/n");
        }
        printf(")/n");
        return 0;
    }
}