UVA - 202 Repeating Decimals

UVA - 202 Repeating Decimals

题目大意：给2个整数相处 求循环小数及其周期数
解题思路：当小数循环时 如果一个余数曾经出现过 那么从这个余数到上个相同的余数就是它的循环周期

/*************************************************************************
    > File Name: UVA-202.cpp
    > Author: Robin
    > Mail: 499549060@qq.com 
    > Created Time: 2016年07月19日 星期二 13时36分36秒
 ************************************************************************/

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
int main() {
    int N,M;
    int t = 1;
    while (scanf("%d%d", &N, &M) != EOF) {
        printf("%d/%d = ", N, M);
        int a[10000];
        int r[30000][2];
        memset(r, 0, sizeof(r));
        int num;
        for (int i = 0; ;i++) {
            a[i] = N/M;
            if (!r[N%M][0]) {
                r[N%M][0] = 1;
                r[N%M][1] = i;
            }
            else {
                num = i - r[N%M][1];
                break;
            }
            N = N%M*10;
        }
        for (int i = 0; i < r[N%M][1] + num + 1 && i <= 50; i++) {
            if (i == r[N%M][1] + 1) printf("(");
            printf("%d", a[i]);
            if (0 == i) printf(".");
            if (i == 50) printf("...");
        }
        printf(")\n   %d = number of digits in repeating cycle\n\n", num);

    }
}