11-09 Exercise 2: Reduce the fraction to lowest terms

2 like 0 dislike
9.3k 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.3k views

67 Answers

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

int main()
{
*** ***** *    *  * * * *** ** * m = 0;

* ******    *  * **   ***    ** n = 0;

    ** *   * ******   * ** *  i = 0;

**  *** *  * *  ** * **  * ** ** result = 0;

** ****  *   *  ** *   ****   *** *    *      ** * * &m, &n);

*****   * *** ** *   *** * *  = 1; i < 1000; i++)
 ********** * *    ** * *   ** 
  *  * ** **  **** *  ** * **    * * **  **     ** **  % i == 0 && n % i == 0)
  *** ***   **** *****   **** *   *****   * * * 
* *  ** *** * **   *  * *   * * ***** *   * **   *  ** *   ** *       **** ***   /= i;

 *  *  * * *  * ****   *** ********** * * * *  **  * * *      ***  * *  *   *  * *  /= i;
  * *   * *   *  *****   *****  **   * *  *  *  **     * 
** **  ********* ***  * ***
**   ******   * ******* ***   % n == 0)
  ***   *** ** * **     * * 
    * * *  * ** ******  * ***   * ** *  ****  *    *   = m / n;

* ** ******* *** ** *****  **  * *** *  * **** *  *  *      ** ******** result);
    }
 * **    ****  ******   **  
*****     *  **   ** ** *   * 
**  **   ** *** **  ***** * **  ***** * *   *   * **   *  ****     ***  *     m , n);
****     *  *** * *  ** *   *  

}
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
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
int main (void)
{
*     *   *     ****     * * *  * *** a,b,c,d;
  ** *    ***** *** **** **   **  * * * * *  *   * ****    ***** **
   *** * *  * *    * *   * **
 * **  ***** ** *  *** *  *  ***
     ** ** *  *  ***** **** ** *  * *    && b>0) {
*  ** * ** *****   *   *    *  * *
 * **   *   *   *****  *      **   * ***** **   *  * *
 * * * **  * ***   ******* ***   * 
*  *** *   ***** *** ******  *   * * ** **  *   **  *
}
 ****    **    **   * ******* ***
  * **** ** * *      * **  * *    **     ***** *   * *    **   *   ***** * *   ******
    }
 * *  *  *    *** *   **  * ** {
*     **    ** ***  ***   ** ** * *  *** * * * **  *  **** ***  ***  *****    **
    }

}
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
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
#include <stdlib.h>

int main()
{
*  *    *  * *  ** * * ** m = 0;

  ******  *   *  * * * ** *    n = 0;

 **   ***      ** * **** *  *** i = 0;

****** *** * * *  ****  *   * result = 0;

**   * *****   * *    *  ** **** * *  ****   &m, &n);

***   ***** ** **** * *  **     ** = 1; i < 1000; i++)
******     **   ***  * *  * 
* *    *    ***   * **      *** *****    *    **  ** *   % i == 0 && n % i == 0)
*  ** *  **** *    *  * * ** ** ** *  *  **
    ** **     * ***** ** **    ****** ** * * * * * * * *     *  *  * * * * *  *  **     * /= i;

*  *    * * *  **  ** * **    *** **  *  *     ***  *****  ***   * *   * * * **** * * /= i;
***** ***** *   *** ** ** ****  **  * * **** *****  *
* * ** **  *  *  * *    **** * 
    * **  *** *   ** **  ***** *  * % n == 0)
* ******   ***** **  
* *  ** * * **    *   *   **** ** **    **   ** ***  * ** *****  = m / n;

   *** ** * *  * *  *  *  ** * *  * *    **  ** **    ** ***** * *  ****** result);
    }
** **  * *****   *  *  * 
 *** * *    ***   *** * * 
**   *   *  * * ***   * **  **    ** ** **  **** **    ** * * *********** ***  m , n);
* **     *  ** ** ** *  *   *

}
answered by (-285 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
int main (void)
{
** *   **** *  * * **** *  *    a,b,c,d;
 **   * * **** *** *   * ****     *** * **    * ***  *** * **** *** * **
***   *  * * ****  **   *****
 * * **  **** ***** * *  * 
 * ** **   *** ********   ** **  *    *****   && b>0) {
     *****   **** *      **   ***** **
*    * *  *****   *   *** ** *    * *    *  ** 
* * * *  *** *    * * *  * ***
**** *    *   *     **  *           **  * **   * **   
}
     ***   ** *  * *  *      **
 *** *  ** *   * *** **  ******   * *  ***  * ******   ******   ** *   ** * ***  *      
    }
  ** ****  * *     *    *** {
*** * *   ***  ** **** *** ***** * ** * *** **  **  ****       * *** **     ***  *   *   * **
    }
}
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
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
int main (void)
{
***  ****   * ** *  *** ***   a,b,c,d;
***** **  ** ** * *  **     **  * ** ** **** * *     ** * * 
  ** *  **  ** * **** **** *
** **   ****   * ***  *  *
*  * *  ***  *** * ** **  ********  ** && b>0) {
***    *  * * *  **  **   ***   ** *****  ** 
   ***  *  ** *   *  * *  **     ** **  *****    * 
        * *   ** *** ** **   *     
 ***  ***      * *  *** * ***  * *****  ** ** ****  ****
}
**    *****  **** ***** *  **    ** 
* ** * **** *   ***     *  *  *  *     *  **   * * *** ***      ***   **  * * * ***    
    }
       ** *     **  * *  * **  {
  *  * ** ** *   *  * *    ** * * *  *      * ** ** *** *   ** *   ** *  **  * ***    *  **
    }

}
answered by (-204 points)
0 0
prog.c: In function 'main':
prog.c:5:16: warning: format '%d' expects argument of type 'int *', but argument 3 has type 'int' [-Wformat=]
     scanf("%d/%d",&a,b);
                ^
commented by (4.3k points)
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: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
int main()
{
** * * *  *      * *  **   * **** n1,n2,num,denom,i,gcd;
 * *  ****   **  ****   *   *** **  *   *   ** **  ***    *   ***** *  
  *** *  ****    **** *  * (n1%n2 == 0)
    {
 *   ***  ** *  * **   ** * *** * *   *    * **   *   *  *  **** ****  
  * * * *****   * *  ** 
 ****     *  * * * *   *  ** **
*    **     **** ******** * *
  *   *  *  **     *  ** ***  * * ** * (i=1; i <= n1 && i <= n2; ++i)
******** * * * ****  ** *
     * * ******* *  **** *  *   **     *** ** *   **  *****  && n2%i==0)
****** **  * *   ***    ** **** ****  ****  **** * *****  *****   ***  *** ** = i;
 ** *     * **** ***  **** *
*   ********  * * *****  ******  ******   *  *** * **  *   *  *** *     *  * *****
   ** *   ***  ******   **   **     *   * *   ****  *** ***  *      *** **  *   ****
* ** ***  * ** ****  *** ***   **   ** ****   *
*******  **  *  **  ******    *
 return 0;
}
answered by (-323 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>

int main()

{
    int num,denom,n=1,flag,bflag;

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

    if (num<denom)
    {
     **   ***  **  *    *** ***      * * ******  * * **   (n;n<=num;n++)
* * *  * *  *  **   *  * ** ** **  ****  ** **   *** *
* * *  * *  *  * *  * * ** *   **   *  **    *    * *  ** * * **  ** ** * **** *** * **  * ***  *
  ***** *  * ** ** *     * *   **    **  * **  * *** * ** *** **** *     * ***  * (flag==0 && n!=1)
 **** ** * ****  * * * *  *  *   ********  *     ******* *  ***   ** ** *****  * *  ** 
*  *  **  *   *    *   *   ** **  * **  ***   *** ******* * *   ** * * * ** *  ******  *** *  *     **   **
* ****  **  * * * *  * **  ***** ***   *** *  * ******* * **** *** **** *** * *    *  * ***  ** *** *  ******  * ** * ***
 * ** ** ******  **** ** **   ** ***  **   ****** ***    ** **  ** **   *  **   * ** *  *     *** ** 
      * *****  *** ******   ** * **  * *  *** * *  *** *  * * *  ***     ****    ***  * **   *  *     ******     * *  
*   *  ******* *** ****  * ** * ** * *     *** ***  *** *******  ***  ** **
 *      **    **   ** * * * ****  ****   *   *      **
    }
    else
    {
* * *  ***         * *  *  **   ** * *  *****  (n;n<=num;n++)
   * ** ** * *** * ** **  *** * *  * **  ** *  *  * ** ***
 ** *  ** *  **   * ** ** ***  ** ***  ** **   * * *  *     * **** ****  ****  *  **   
 *** **  *******   ***** *      **  *   **  * ***     ** *   **  *  *   * ** ***   **  (flag==0 && n!=1)
 * **     * **    ***   *****    **  *****  * **  * ******   * *   * ***   *****     
 * * *    **   ** **    ***   * *    *  * **   * *****  ***** **    **** **  **   ** *** *    * ** *  * *  ***    
 ** ** *  *  ***   * *** **   ** *** ****  * **** *   ** **  ** ***  *** ** *   * *  *  ***  *  *  *  ****  **
* **   *  *    **    *   ** *** **** ** *    * * ** * **     ** *  **** **  *   **        **  ** *     * *** ***  
 ***   * *   *   *** * *  * * *** * ***  *   **  **   *   ** ***   ** **          *  ****** *  **   * **
  **   *   *  * ** *  *   **    *** ***   **    *       ** **  ** **  
  * *  * ** **  **  *    * ***** *     *****  **  **  ** *** *   
    }
    if (denom!=1)
 ***  **    *  **** * **     *   **  ** ********  ***
    else
*  *  *** ****    ***** * ****** *     *  * * * **
    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
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
int main()
{
    int n1,n2,num,denom,i=1;
*   * ** *   ****   **    ** *  ********    * ****  ** **  ** ****
    while (i<n2 && i<n1)
*****  * * ** * * **  **** *   **** * * ** *  *    * **    **
 *  *  *  **      **    **  **     *  *   **  *  **  * *  ** *  
 *  *** *   *    **  ***   * *     * ** ** *  ***** *   **  ***
   *** ** * ***   * *  **  ****   **   ** * **   ***** * *  * *   * *
        }
   * *** ** * *  **   *****     *   * * **** ** **  * * **** ***  *  ** *   * ** *
**  *    *       ***    ***** ** ** * *  ***    * *** * *  ** ** ** * *  **    **
   * *   **     *  *  *  ***  *** *  ** ***** *   * * **  *  * **   *  *   * *   *** ** *   * ** ****    ** ** * **  * *   ** **  ** * **** 
*  *  **   *  * *  *****   **  **  ** * * **    ***  ** * ***  **** * * *
  ***  *  **  * **    *****      * *  ** ****  *   *      ****  **** * **** * *
 *  * *  * ***** * * ** **   ****** ***** *     ** *  *  *** *   *  ****    *   *** 
 ***  *  *  * *    ***** ****  ****  *** * ***** ** *  **      **    * ****  * *  * *** ** *  *  * **  * ** ****   ** *** *  ****   *
**  *   * **  **  *  * * *** *     * **    * **       **   * *** * * ** **      *  * * *

 return 0;
}
answered by (-323 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Wrong output
Case 4: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
int main()
{
    int n1,n2,num,denom,i=1;
**** *  *** *** * ** *** ***   ****** ***** * * *        ****  *** *
    while (i<n2 && i<n1)
  * *   * ** **  ** ** *     **    * * * * * *       **
**  **    *  ***  *   *     *  ** *    * * **   **    ***  ****** 
 * *  ******  ***  *   *** ***    ***  **   *** *  *** *** **
 *   * * ** * ** ** **** **** ** *           ** *****   * **  **
        }
**    * **** * * *  **   ***  * *     *  ** * * **  ***     * *    *  ** * ********
      *** *****     *** ** ** *     ** ** *   * **      ******** ** *****    *    **   ***
   *  *   ******** **   * *   ***   *  **  **  **    ***   * *   ***   ** **   *****     * *** **  * *       *   *  ***  *****  
* ** ******  * ** * **  ** * *     ******  ** *   ****** **   * ****** * ** * *** * *
   * *** ** * ** **   ***  *  **      * **  ***** *** * * * ** ** ** ** * * *** ***     
** *   ***** *** **  *  * **      ***  **** *    * * ** *   * **  **  **  *  *  *
* ***** **** * ***  * ** *   ** *   *  **  *     *  **   * *** *  * *      *  *  * * *  * * * * ********       *   * ** *   * *   *  *  * *   *
   **    ******   * ****   ** *    *   *** ***   ** **** **  ** *  * **  *** **    *

 return 0;
}
answered by (-323 points)
0 0
Case 0: Correct output
Case 1: Wrong output
Case 2: Correct output
Case 3: Wrong output
Case 4: Wrong output
commented by (4.3k points)
Page:
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.69.59.175
©2016-2025

Related questions

0 like 0 dislike
71 answers
11-09 Exercise 1: Print a one-month calendar
[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.5k views
0 like 0 dislike
72 answers
11-01 Exercise 2: Find out all the factors of N
[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.1k views
1 like 1 dislike
85 answers
10-26 Exercise 2: Displays the number of its digits and their sum
[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.5k views
0 like 0 dislike
69 answers
10-26 Exercise 1: Calculates and displays the GCD of 2 integers
[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 | 8.8k views
12,783 questions
183,442 answers
172,219 comments
4,824 users