2 like 0 dislike
18.4k views

Write a program that asks the user to enter a fraction, then reduces the fraction to lowest terms.

寫一個程式 輸入一個分數,約分為最簡分數後輸出

Example input:

6/12

Example output:

1/2

Example input 2:

12/6

Example output:

2
[Exercise] Coding (C) - asked in Chapter 6: Loops by (5.2k points)
ID: 31048 - Available when: 2017-11-09 18:00 - Due to: Unlimited

edited by | 18.4k views

67 Answers

0 like 0 dislike
Hidden content!
#include<stdio.h>

int main(){
* * ** * * * ** *** ** a,b,c,d,e,small,i;
* ** * *** * * * * ** * ** *********** *** *
* * ** ** * *** ** **** *
* * ********* * * * * * ** ** *** ** * ** **
    }
* ** * ** * ** * * {
* *********** * * * * * ** ** * *** ** * * * *
* ** *** **** * * **
** *** ** * * * * ** ** * ** * **** **
** * * * * **** * ** * * * *** ** * * * && b%i==0){
****** ** ***** * ** ** ** * ** **** * * **** * *** * **** **
** ***** ** ** ** * ** ** * *** * * *
    }
* **** * ** *** * ** *
**** * * * ** * ** ** *
*** **** ** ** ** ** ** *
* * ** **** **** ** ** ** ** * * *** * *
    }
******** **** * * * ***** * * ** *** * * * *



return 0;
}
answered by (-301 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output
0 like 0 dislike
Hidden content!
#include <stdio.h>
int main()
{
* * * ** * * * * * * * a,b,a1,b1,c,d;
* * ** ** * ** * ** * ******** * *** ** * ** * **
********** *** **** ** * *
* * * *** *** * *
* * *** ** * *** * ***** **
* ** * ** ******* * **** * ** *
    if (d==0)
* * * * * * * * ***** ** * *** ***** * *** *** * * ** *
**** *** ***** *** * **
    {
* ****** ** ** ** * *** ** * ** * * *** * * **** * * * ** * (b != 0)
****** * *** ** *** * * * ** * ** * * **** * * * ***** ** ** ** * *** ** ** **
** ** ** * * * * ***** ** ** ** * * **** ** * * = a % b ;
* **** ** ****** * * * * ******** ** * * = b ;
** * * * ** ***** * *** * ** ** *** * ** ** = d ;}
*** ** * ****** *** **** **** ** **** * **** * *** * ** * *** * ** * * *
    }
* ** * ** ** * * * * **** * 0;
}
answered by (-196 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output
0 like 0 dislike
Hidden content!
#include<stdio.h>
int main()
{
* ** *** * * * a,b;
** ** ** *** ** **** * * * ** * * ** **
** *** * ** * * ** ** **** *
*** ** **** * * ** *
*** * ** * * * * ** *** * * ** *** * **** * *** *** * ** ***
***** ** * * **
* ** ** ** * ***** *** * ** ** * **
**** ** *** *** *
***** ** ** ** * * * *** * ** ***** * * * ******* *
    }
** ***** * * ** * * ** * * **** ** * *
    {
* ** ** ** *** * * ** * *** * ** * * * ** ** *** **
    }
** ** ** *** ** * * ** * *** ** * ***
    {
** *** ** * * ***** * * ** * * ** * ** * **** **
* * * * ***** * *** * **** **
* ******* ** *** ** ** * * 0;
}
answered by (-255 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Wrong output
Case 4: Correct output
0 like 0 dislike
Hidden content!
#include <stdio.h>
int main()
{
* ***** * *** nom,denom,i,a;
* **** * ** * * ** * * *** * ** %d", &nom, &denom);
* ** **** * * ** * * ** ****** i<=denom; ++i)
    {
* ******* * * * * *** ** * * ** ** *****
* ** * * * * ** * * * ** * *** * ** && denom%i==0)
* ** **** * * * * **** * ** ** ** * * * * ** ** *
* **** * * * ** ** * * ** *** * * **** ** * * * *** ** = nom/i;
** * * * ** *** *** * * * * * * ** ** ** * ** ** = denom/i;
* ** * ** * * * ** * * * * * * ** * ** ** * *** ** * **
* ***** * * ** * ***** * **** ** * *** *** *** * *** * * *** **
***** * ** * * *** **** ** ** ******* * * *** *** *** *
********** ** **** * * ** * * **** **** **** * ** * ******** ** ** * ** * * * ** *******
** *** ** *** * * * * ** ** ** * **



    }
* * * ** * ** ** ** ** * 0;
}
answered by (-281 points)
0 0
Case 0: Wrong output
Case 1: Correct output
Case 2: Correct output
Case 3: Wrong output
Case 4: Correct output
0 like 0 dislike
Hidden content!
#include<stdio.h>
int main()
{
* ** *** * * * ** * a,b;
* * * ** ** * * *** * * ** * ** * ***** ***
*** * * * *** * ** ** * ** * *** * ******
*** ** ***** ** * * *
** * * ***** * * * * * ** * * * * ** ** * **** * * *** * **** * **
    }
** * * * ***** * * ** ** * * *
    {
* *** *** *** * * ** * * * ** * ** * ****
** * * **** * ** *** *
**** *** * * * ** **** *** ** 0;
}
answered by (-255 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Wrong output
Case 4: Correct output
0 like 0 dislike
Hidden content!
#include<stdio.h>
int main()
{
******** * ** * **** ** * a,b;
**** ** ***** *** *** ** ** *** **** **** * ** *****
* ** ***** ** *** ** * *** *** * *********
* * ** * ***** *** * **
**** **** * **** *** * * * * ** *** *** * * ** ** ** ******
    }
* ** ** * * ***** * **** * ******* **
    {
** * *** * * * * * * * ** ** * * ** * *** * **** * * * *** * *
**** *** * **** * ***** ****
** * **** **** * * ** ** 0;
}
answered by (-255 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Wrong output
Case 4: Correct output
0 like 0 dislike
Hidden content!
#include<stdio.h>
int main()
{
*** **** * *** ** * * a,b;
* ** ***** ** * ******* * *** ** *** * ** * *****
** * ** * **** ** * * ** * ** * * *
* ** * * ** ***** **
* * * * ** ****** **** * * * * * *** ** ** * * * * * ** * *******
    }
** *** * * * ** * ***** * ** ** **
    {
*** * **** * ** ** * * * ** * * **** *** * * * ***
*** * * ****** **** **
**** * * * * * * ** 0;
}
answered by (-255 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Wrong output
Case 4: Correct output
0 like 0 dislike
Hidden content!
#include <stdio.h>

int main()

{
** * ** * ** * **** **** num,denom,n=1,flag;

* * * * **** * * ** *** * **** ** * * * ** * **

    if (num<denom)
    {
* * ** * ****** **** ** * * * **** * **** ** * (n;n<=num;n++)
** *** *** * * * * * *** ** * * *** *
*** ** *** * * * * * *** *** *** ** *** * ***** *** * **** * *
* ** * ** * ** *** *** ** **** * * *** ******** ** ** * (flag==0 && num==n)
** * * ** ** * ** *** ***** ** * ********** ** * *** * *** *** *** ****** ** * * *** *
* *** * *** * ****** * * ** * * *** * *
*** ** ** *** ** * ** **** * ** ** ** ** ** = num/n;
* * * ** ** *** ** *** ** * * * **** **** * * = denom/n;
** *** **** ** * * * * * ** ** ** ** **** * * ** * **
    }
* * *** * * **
    {
* * ** **** * * **** * * * ******* ** *** * *** * (n;n<=denom;n++)
***** ** *** ** **** * ** * ** * *
** * *** * ** ********** * * ** * ***** * ** * **** **** * ** ** *** ** *** *
** ** * ***** **** *** ***** * *** * * * * * ***** ** * * *** (flag==0 && denom==n)
* * *** ** ****** ** * * * *** ** ** * ** *** * ** *** ** ** * * ** * * *
* ******* * * * * * ** *** * *** **** * ** **
* **** *** *** * ** ** * * ** ** * **** *** *** ** * ** /= n;
** * ****** * ** * *** **** * ***** * ** ** * * /= n;
*** * * ** **** *** *** * * *** *** * * * **** ** **** ** * * **** ** *
    }
** * * *** * * ***** 0;


}
answered by (-249 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Wrong output
Case 4: Correct output
0 like 0 dislike
Hidden content!
#include<stdio.h>
int a,b,i,j;

int main()
{
* **** * ** * * ** *** ** **
for(;;)
*** * *** ** * ** *
for(i=1;i<(a+b);i++)
{
* * * ** * *** *** * * *** * * *
* *** * * * * ** * ** **
** * ** * *** **** * *
** *** *** * *** ** * **
** * ** ** * *** * * * ** * *** ******
** ** * ** ********
}

i=1;
j++;
if(j==10){break;}
*** ** * ** ** ** **

** ** * ** ** ** * * * * ** * ***
* * * * *** * ** ** * * *** ******** * *


}
answered by (-336 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output
0 like 0 dislike
Hidden content!
#include<stdio.h>
int a,b,i,j;

int main()
{
***** * *** *** ** ** *** *
for(;;)
* * * * * ******
for(i=1;i<(a+b);i++)
{
** * ** * ****** **** *** * *** ** *
* **** ** ** * ******
* **** ** ** ** ** ******
** * ** * * * *** *** * ** * **
** * *** * * ** * * * **** * * ** * * *
* * *** ** **** *** *
}

i=1;
j++;
if(j==10){break;}
*** * * ***** ** ***

* * ** ** * *** * ** * ** * ** * **** * *** * * * *
* ** * * ** * * * ** ** *** * * ** *


}
answered by (-336 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:162.159.115.10
©2016-2026

Related questions

0 like 0 dislike
71 answers
[Exercise] Coding (C) - asked Nov 9, 2017 in Chapter 6: Loops by semicolon (5.2k points)
ID: 31047 - Available when: 2017-11-09 18:00 - Due to: Unlimited
| 18.3k views
0 like 0 dislike
72 answers
[Exercise] Coding (C) - asked Nov 2, 2017 in Chapter 6: Loops by semicolon (5.2k points)
ID: 29831 - Available when: 2017-11-02 18:00 - Due to: Unlimited
| 18.1k views
1 like 1 dislike
85 answers
[Exercise] Coding (C) - asked Oct 26, 2017 in Chapter 6: Loops by semicolon (5.2k points)
ID: 28914 - Available when: 2017-10-26 18:00 - Due to: Unlimited
| 24.1k views
0 like 0 dislike
69 answers
[Exercise] Coding (C) - asked Oct 26, 2017 in Chapter 6: Loops by semicolon (5.2k points)
ID: 28913 - Available when: 2017-10-26 18:00 - Due to: Unlimited
| 18.3k views
12,783 questions
183,442 answers
172,219 comments
4,824 users