2 like 0 dislike
9.6k 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 | 9.6k views

67 Answers

0 like 0 dislike
Hidden content!
///Reduce fraction to lowest terms
///Elvis Suazo
#include <stdio.h>
#include <stdlib.h>

int numerator,denominator,i;


int main(){
** * * **** **** * **
* ** * *** * * * * ** ** * * *** ** *** ** * * ** * ** *
** ***** *** * * * *** ** * **
** ****** * ****** **** ******* ** ******

*** * ** * * * * * * * ***** ** * ****** ** * && denominator%i==0){
** **** * ** ******* * ** * * * *** *** * ** *** ***** * * *** ******
* ** * * *** **** * *** ** ** ** ** * ** * * * ** * ** **** * * * ** ** **
* **** ********** *** * **** * **** * *** *** * ****** * **** * * *
* * ** * ** ******* ** * * *** * * * **** *
* **** **** * **
***** * ** * * * * * ***
* ** ***** * * ** ** ** ** * * * **** ****

*** *** * * * * **** *** * **** * * * *
**** ** * *** * * * ** *** ** * * ** ** ** ** * ** * * **** **
    }
*** *** * * * * ***** * * * 0;
}
answered by (-286 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()

{
    int num,denom,i,a,b;
*** ** *** ** * ** * **** * * * * * *** * *** * * ** ***

    for (i=num;i>0;i--)
    {
*** ** *** ** * ** *** ********* ** * *** * ** * *
* * **** ** * ** ***** *** ***** * ** * (a==0)
** * * * *** ** ** ** ** ** * * ****
* **** *** * * * * * * * * ** * ** **** *** *** * *** ** **** * **
** * ** *** * ** * * ** *** * * * *** * ****** ** * ** * * * (b==0)
**** ** *** *** * * *** * * * * ** * ** ** * *** * * ** ****
* * * ** *** ****** *** * *** ** * * * * ** *** *** ** ** * ** * ** * * * * ****** *** (num<denom)
** *** ** * * * * * **** **** * ** *** ** * * * **** * * * ** ** * *** * ** *** *** * **** * * ** ** * ** * * * * *
**** ** ** * * * ****** * * ** * * ** * ** * * * **** ** ****** ** *** **** *** * *
* ** * ** *** *** *** * * *** ** * * * ** * * * * * * *** * ***** * * ** ****** * * * * *** ** *
* ** * * *** *** ** *** * *** * * * * * ****** *** * * ** *** * ** ***** * ** *
** *** ** * * * * * *** *** ** * **** * * * ** * ** * *
** ** * **** * **** * ***** * ** *
    }

    return 0;

}
answered by (-249 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 * **** **** ***

int
{
* int n, d, gcd, i;
** * *** ** * ** *** *** ** ***** ******* * * *
* *  
    **** * *** i <= n * * * ****** i <= d; ++i)
** * ** ** * * ** * **
**** * ** * ***** ******* * ** * * * ** * **** * * * d%i==0)
* * *** ** * * *** * ** * * **** ** ** * ** * * **** ** ** * = i;
** * *** * * * *
** * *** * **
* * **   n/=gcd;

** * * *** * d/=gcd;
* **   if(d==1)
* * * * * *** * * **** **** * *
** * * * *** * ** *
* ** ** * ** ** * * * * * * * * * * * * ** * n,d);
* * * * * *

* * **
* * ** * *** * **
* *** ** * * * **** ** * ** * *** * *** *** 0;
* * ******
** * * * *

* *** * *****
answered by (-304 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 * **** * * *

int * * *
{
*** *   int n, d, x, y, rem, gcd, i;
*   * ** * ** ** ** **** * * ** **
*** *   ***** *
****   * *** *
**** * * * * ** i <= n * * ** i <= d; ++i)
**** ***** * *
* * ** ** *** ** *** * *** *** ***** ** ** * ** **** ****** d%i==0)
*** ** * * * * *** * ** * * ** * * *** * ** **** * * = i;
**** ** * ** ******** *
* ** *** * n/=gcd;
* ***   d/=gcd;
* *
*** * * * * ** * * *** *
*** ** * ** *** *** * *
* *** * *** * *** * ** ***** * *** * ** * n,d);
* * ** * * ** ** **

*** * **
**** * ** * *** *
* ** ** ** * * * *** * * * * * 0;
* ** *** ** ***
* * * *** * *

*** * * *
**** *** * ** * *
answered by (-304 points)
0 0
Case 0: Correct output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Correct output
Case 4: Wrong output
0 like 0 dislike
Hidden content!
#include <stdio.h>

int main(void)
{
** * * * * **** a1,a2,a3;

* ** *** **** **** * ** a;
* *** **** * * ** * * * *** b;
***** **** ****** * * * c;

* * *** ***** * * * * **** * ** *** * &a1, &a2);
* * * * *** * * * **** = a1;
*** ** **** * * = a2;
    c = a % b;
*** ** * ** * * * * * ** * > 0)
*** * * ** **** ** * *****
* **** *** * * *** ** **** * * * = a % b;
**** *** *** ** * * ** *** ** ** *** * = b;
** ** ** *** ***** ** * ***** ** ** * * ** = c;
* ** * * * ** ** *
** * ** *** ******* * a;
** * *** **** ** /=a;
* * * ** * **** *** ***
* ** **** * ** * ** * ** *** * ** *** ** ** * * * * ** * * * *** *
* * * * *** * * ***
******** ***** * **** *** * ** ** * * ** * ,a1,a2);}


return 0 ;
}
answered by (-254 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(void)
{
* ***** * * * * **** a1,a2,a3;

*** * * * * ** *** a;
** *** * * ** ** ** ** * * b;
* * * **** ** * ** ** * c;

*** ** * ** * * *** ***** **** ** ** * &a1, &a2);
* * * ** **** ******* * = a1;
** * * * * * * ******* = a2;

**** ** ** * * * * ***** * > 0)
* * * * * * * **
** * ** * ** *** *** * * **** ***** * **** * = a % b;
***** ***** **** * * ******** * * ** * ** **** = b;
*** ** * * *** * * * * * ** * ** ** * * * = c;
** ****** * * **** * **
* * * ** * * * * ** a;
* ** ****** * ** ** * **** * /=a;

*** ** * *** * * * *** * ** *** ** ,a1,a2);


return 0 ;
}
answered by (-254 points)
0 0
Case 0: Correct output
Case 1: Wrong output
Case 2: Correct output
Case 3: Correct output
Case 4: Wrong output
0 like 0 dislike
Hidden content!
#include <stdio.h>

int main(void)
{
** *** * ** * * a1,a2,a3;

* * ** ***** * * * ** a;
** *** * * * * ** * b;
*** ************ * * ** ** c;

* ** * ******* *** **** * * * * *** * * &a1, &a2);
*** * * *** * * = a1;
******* *** ** * ** *** * = a2;

** * *** * ** * ***** ** > 0)
** * * **** * **** *
** ** * *** ***** *** ***** * * * * * ** *** = a % b;
* **** **** * * *** * * * *** ** * ** * * **** ** * = b;
* *** ****** ** ** ****** * ** * * * ** ****** ** = c;
* ** * ** ***** *
** * * * **** ** * ***** a;
* ** ** *** ** ** * /=a;

* * * * ** ** ** *** * ** ** * * ,a1,a2);


return 0 ;
}
answered by (-254 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
Case 4: Wrong output
0 like 0 dislike
Hidden content!
#include <stdio.h>

int main(void)
{
*** * * ****** * * a1,a2,a3;

* ** **** ***** * * a;
* * * ** *** *** **** b;
****** ** ********* ** ** * c;

** * * * *** * * ** *** * * *** ****** &a1, &a2);
** ** ** * ** ******* **** = a1;
* * * * * ** * *** ** * *** = a2;

* ***** *** *** *** * ** > 0)
*** * ** * * ** *
* * * ** * * * * *** * **** ** = a % b;
***** * *** * * * * **** ** * ** *** * * * = b;
** * *** ** * ** ** ** **** * * * = c;
*** **** * ** * *** **
*** * * ** * * * a;
*** * * *** ** * ** /=a;

** ******* ** *** * ** **** ** ** * ,a1,a2);


return 0 ;
}
answered by (-254 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
Case 4: Wrong output
0 like 0 dislike
Hidden content!
#include <stdio.h>
int main (void)
{
** ** ****** *** * ** * ** *** a,b,c,d;
*** ** ** * *** * ** ** *** * ** **** * *****
** ** * * *** ***** ** * *
* * * *** ** ** * * *
* ** * * * * ** * **** *** **** && b>0) {
* *** * **** * * * * *
* ** ** ** ** ** * * *** ** ** *** * ** **
** * * *** **** *
*** * * * * * ****** ** * **** * *
}
* *** * * *** * **
** **** ** * **** ** ** *** ** ** ** * *** * *** (d/b!=1)
*** * ** ** ***** ** ** *** *********** * * ** * **** *
* ** ****** ***** *** **** ** ** * *** * ** printf("%d",c/b);
    }
** * ****** * * ** ** {
* ** * * ** ** ** ** * *** * ** * * **** * (d/a!=1)
** ** ** ** ** ** * ** * ** **** ** ** * *** *** * ** * *** * **
* *** *** * * ** ** ** * ******* * ***** *** printf("%d",c/a);
    }
}
answered by (-204 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 (void)
{
** ***** *** *** ** * a,b,c,d;
* * * * * *** * ** *** * *** ** ** * * ** *
** *** * *** *** * * **
** ** *** * ** ** *** * *
* * * ********** * *** && b>0) {
*** ** *** ** ** * ***** * ***
**** ** * * ** ** * * ** *** * **
**** ** ***** ****** ***
*** * ** * * * * * ** * **** ** ****
}
* *** * ** * * * * **
** * ** ** * * * **** * * *** * ***** ** ** (d/b!=1)
** ** ** ** * **** * * ** * ***** * ** * **** *** ** * ** *** * *
** **** * * * **** * ** **** ** * **** * *** * printf("%d\n",c/b);
    }
* * ** * * ** ** *** ** {
* * ** **** ** ** *** ** * * * ** (d/a!=1)
*** * * *** *** **** * ** * * * ** * *** * ** ** * ** * *
** * * **** * * *** * ** * ** * ** * * printf("%d\n",c/a);
    }
}
answered by (-204 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
Case 4: Wrong output
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.69.17.11
©2016-2025

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
| 9.6k 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
| 9.3k 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
| 11.8k 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
| 9k views
12,783 questions
183,442 answers
172,219 comments
4,824 users