求循环小数

对于任意的真分数 N/M （ 0 < N < M ），均可以求出对应的小数。如果采用链表表示各个小数，对于循环节采用循环链表表示，则所有分数均可以表示为如下链表形式。

输入： N M

输出： 转换后的小数（不超过 50 ）

要求： 仅编写将分数转换为小数的函数 change( int n, int m, NODE * head ) 。 

测试输入	期待的输出	时间限制	内存限制	额外进程
测试用例 1	以文本方式显示 1 8↵	以文本方式显示 0.125↵	1秒	64M	0
测试用例 2	以文本方式显示 29 33↵	以文本方式显示 0.87878787878787878787878787878787878787878787878787↵	1秒	64M	0
测试用例 3	以文本方式显示 7 18↵	以文本方式显示 0.38888888888888888888888888888888888888888888888888↵	1秒	64M	0
测试用例 4	以文本方式显示 2 7↵	以文本方式显示 0.28571428571428571428571428571428571428571428571428↵	1秒	64M	0

预设代码

前置代码

/* PRESET CODE BEGIN - NEVER TOUCH CODE BELOW */

#include <stdio.h>
#include <stdlib.h>

typedef struct node
{   int         data;
    struct node * next;
} NODE;

void output( NODE * );
void change( int, int, NODE * );

void output( NODE * head )
{   int k=0;

    printf("0.");
    while ( head->next != NULL && k<50 )
    {   printf("%d", head->next->data );
        head = head->next;
        k ++;
    }
    printf("
");
}

int main()
{   int n, m;
    NODE * head;

    scanf("%d%d", &n, &m);
    head = (NODE *)malloc( sizeof(NODE) );
    head->next = NULL;
    head->data = -1;
    change( n, m, head );
    output( head );
    return 0;
}

/* PRESET CODE END - NEVER TOUCH CODE ABOVE */

编写代码如下：

/* PRESET CODE BEGIN - NEVER TOUCH CODE BELOW */

#include <stdio.h>
#include <stdlib.h>

typedef struct node
{
    int         data;
    struct node * next;
} NODE;

void output(NODE *);
void change(int, int, NODE *);

void output(NODE * head)
{
    int k = 0;

    printf("0.");
    while (head->next != NULL && k<50)
    {
        printf("%d", head->next->data);
        head = head->next;
        k++;
    }
    printf("
");
}

void change(int n, int m, struct node *head)
{
    struct node *p, *left, *p1, *head_yu, *yu1;
    int chu;
    int shang;
    int i, k;
    int yu;
    chu = n;
    p = (NODE *)malloc(sizeof(struct node));
    left = (NODE *)malloc(sizeof(struct node));
    shang = chu * 10 / m;
    yu = chu * 10 % m;
    p->data = shang;
    head->next = p;
    p1 = p;
    if (yu == 0){
        p->next = NULL;
        return;
    }
    if (yu == chu){
        p->next = p;
        return;
    }
    left->data = chu;
    head_yu = yu1 = left;
    left->next = NULL;
    chu = yu;
    for (k = 1; k <= 49; k++){
        int count = 0;
        struct node *c;
        c = head_yu;
        while (c != NULL){
            if (c->data == chu){
                count++;
                break;
            }
            else{
                c = c->next;
                count++;
            }
        }
        if (c!=NULL&&c->data == chu){
            struct node *zhuan;
            int count2;
            zhuan = head;
            for (count2 = 1; count2 <= count; count2++)
                zhuan = zhuan->next;
            p->next = zhuan;
            return;
        }
        p = (NODE *)malloc(sizeof(struct node));
        left = (NODE *)malloc(sizeof(struct node));
        shang = chu * 10 / m;
        yu = chu * 10 % m;
        p->data = shang;
        p1->next = p;
        p1 = p;
        if (yu == 0){
            p1->next = NULL;
            break;
        }
        left->data = chu;
        yu1->next = left;
        yu1 = left;
        left->next = NULL;
        chu = yu;
    }
}

int main()
{
    int n, m;
    NODE * head;

    scanf("%d%d", &n, &m);
    head = (NODE *)malloc(sizeof(NODE));
    head->next = NULL;
    head->data = -1;
    change(n, m, head);
    output(head);

    return 0;
}

/* PRESET CODE END - NEVER TOUCH CODE ABOVE */