12-07 Exercise 1: Complete a program (prime number)

0 like 0 dislike
2.1k views

寫一個判斷是否為質數的程式

We have the uncompleted program below:

#include <stdio.h>
int is_prime(int n)
{
   /*INSERT YOUR CODE HERE*/

   /*在這裡寫你的程式*/
   /*END OF YOUR CODE*/
}

int main(void)
{
   int n;
   scanf("%d", &n);
   if (is_prime(n))         // function return 1
      printf("Prime");
   else                     // function return 0
      printf("Not prime");
   return 0;
}

Please complete this program by only insert your code between those tags:

   /*INSERT YOUR CODE HERE*/
   /*END OF YOUR CODE*/

Remember: A prime number is a whole number greater than 1, whose only two whole-number factors are 1 and itself.

You may correct the cases, but your code always be revised!

[Exercise] Coding (C) - asked in Chapter 9: Functions by (5.2k points)
ID: 35783 - Available when: 2017-12-07 18:00 - Due to: Unlimited
edited by | 2.1k views

70 Answers

0 like 0 dislike 
Hidden content!
#include <stdio.h>
int is_prime(int n)
{
 *** ** * ** **     *  *     i;

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

 *****   * *** ****  * ****     * ***  *  
**  *    **  * * ***   * ** 
   ** ****      ** ***  ** ****  *       *  **  * ***   *  *  ***   
    ***  **  * ** * ****** * * * ** *** *  ** **   *    * ***  *  *** **   * ** ****** 0;
 * *   ***   *  **    *** ****  
* *  **** *  ***    **  *  **  1;
}

int main(void)
{
   int n;
**    ** *   *   *****  *  **  * *** ** &n);
   if (is_prime(n))  * *  ****   *  ****  * **    *   *** *** * * * *  ** ** function return 1
  *    *****  * **** **    * *** **  * * ** **     *** ** *   *   *  
    * ** *  ** * **    *  **** * **    * ** * **    **** ****     *****  ***  ***      ** ****    **** *  * ** ***   ** *****    **     * *     **    **   function return 0
*     ** * ** **  **  **   * ***  *   * * * *  *  *    prime");
  * *** *   ** *     * 0;
}
answered by (-140 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output
Case 5: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
int is_prime(int n)
{
***        *   ** *  * i;
 ** * * ******  *    *    (n<=1)
 *  *   ****** * *** * * *** *   *  0;
*  **    *  ** *   * * (i=2;i<n;i++)
   {
     **  *   * ********** *  ****  *** *** ** (n%i==0)
*** *  * * **    *** **  ***  * ****** *  * * **** **   
  ***** *** **       *****    * ***** *    *  **  *  *   *   ****  * 0;
   * ** *   * *    ** *      * * ***   **     
*  ******   ***  **      ***  * * *** ** * **  * * * *  *
* * *   *** **  **   *     * ********** **  **    
*  * *   **** *  ****      *    *   ****    *  *    * ** ****  * * *** **  1;
   * ** **   * *  ***   *   **** * *    * * 
   }
}

int main(void)
{
***   ***  **  *  * ** n;
* **     *****  *   * * *****   ** *** * &n);
   if (is_prime(n)) * *  * *  **** * *** *  * ****   **   * *  * * ** * ***   function return 1
  ** * ** * *  *** ***   *     *  ****  **  *   * ** ** *** *    *
* * * * *   ****  ** * **  ****  *  ** * **  *       ******    **** * *******   *  *  ** ***** **   * ***   ** * **** **   ***  *  **** **** *  * ******      **   ** function return 0
  *      **   * **  *****  *** * **** **  **     *     **    prime");
*****  ***    * ****  0;
}
answered by (-66 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output
Case 5: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include      **    *   *
#include *   * **  *  * *
int is_prime(int n)
{
 **   ***   * * ***    *    divisor;
if (n<=1)
* *  ****  * * false;
for (divisor         ***  ** **     **
 * * ***  **     * **  **
return true;
}
int main(void)
{
* * *** *** *     * n;
  *  ** * * *   **   * **** **  * *** &n);
***  ***  * **  * **   (is_prime(n)) * *****    ***  * *      * *  *  *  *****  ** * * ** ** * function return 1
 *    ** * *** * **  ****  *  *   ** ** * * * *** *** ** *    *  *  **
** *       * ** * ****    **  **** * **  * * ***   *  * **  *    *  *   *    *** * ***   * *  *  **  **   * * **  ****   **    ** **   ** **    * ** ***    *  function return 0
*  ****  *  **** **  *  ** ******** * * **   *   ****  * * *****  
*   *  *   *** ***   **   0;
}
answered by (16 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Wrong output
Case 4: Correct output
Case 5: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
int * *  *
if ** **
** * *    * **     *  false;
for *  *  ***     *****   ** * * ** *
    * *  **  **    
 * *** * *** ***     *        ** false;
  ***  true;
answered by (16 points)
0 0
prog.c:2:1: error: expected identifier or '(' before 'if'
 if (n<=1)
 ^~
prog.c:4:1: error: expected identifier or '(' before 'for'
 for (divisor =2;divisor*divisor<=n;divisor++)
 ^~~
prog.c:4:17: error: unknown type name 'divisor'
 for (divisor =2;divisor*divisor<=n;divisor++)
                 ^~~~~~~
prog.c:4:32: error: expected '=', ',', ';', 'asm' or '__attribute__' before '<=' token
 for (divisor =2;divisor*divisor<=n;divisor++)
                                ^~
prog.c:4:43: error: expected '=', ',', ';', 'asm' or '__attribute__' before '++' token
 for (divisor =2;divisor*divisor<=n;divisor++)
                                           ^~
prog.c:7:1: error: expected identifier or '(' before 'return'
 return true;
 ^~~~~~
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
int is_prime(int n)
{
*  * ****** *    ***  *  * i;

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

*  **  ** ***  *   * *    * * * * *  **    
  *   *   * ***   ***   *   
*     * *  **   **   ***** **  * * *     *  * **  * ***    * **** *
   * *   *  * *********    *      * *    * **  *** ** * ******  * ***  ** *** ** ***   * ** 0;
*  * **  * *******     *****    **
   ***  **** ****       **  **  * *  1;
}

int main(void)
{
   int n;
   *   * * *  ***     *    **** ** * * * &n);
   if (is_prime(n))  *   *  **  *  ** ****    **  * *****         **  *    *** function return 1
 * **   ** ** *  ** *  *    **     * *****  ** * *  * *  *****
    * ***  *  **  ****** *  *  **  * * *  * ****** *** *    * *  ** ** * *** *     ***  * ***  * *   *     * ******** * ** * *** * ** * *********  *   * *** *   function return 0
* *    ** ** * *** ** ** * * ***  * *  **   ****  *  prime");
*  * ** **  * * *    **** 0;
}
answered by (-16 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output
Case 5: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
int is_prime(int n)
{
 **    ***  ** ** **   *  *    YOUR CODE HERE*/
*   * ** **  *** ***    *******  i;
**  ***  *  *  **  *     *    * *  **
   * * ** *** **  *  ***  * *  ***    0;
****** ***  * **** *  **** **** *   * *    ***  
* **   ***    ******  * * * * *** * **  * * *   ** *      **  * **
 *  * ** *  * ** *  ** **** *  *    ***   *  *      * ***  **** * ** * *** ** * **      *  0;
  *  *****   ***  * * ** ***
** * * *   * * ***  ***   ** ***    1;


*   *** *  ***   ** *  *      ***  
*  *  **  *      **  **  OF YOUR CODE*/
}

int main(void)
{
   int n;
*  ** * *** *  *   ***  * **    * ** * *  &n);
   if (is_prime(n)) * **** * *  **** *  * *** *  *** *****  *  * *  * **  function return 1
   *  * *  *  ** *  *** **   ** ****  **   **  *   ** **
  **** *  *  ***  **   *  *** ** *  * * *   ** *******  * ***  *      ***  ** **    ****   *******   **  *   *** *  ***   * *   * * * ****** ***  **   * ***  function return 0
**** * ** *  * * * *   *  * ** *** *  ** ***  ***  ** prime");
  * ****      *  * *    *** 0;
}
answered by (-329 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output
Case 5: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
int is_prime(int n)
{
   ** *** *** ****  ** * *   * *** i, flag;
 ****  **** * * * *** * *   * * i<=n/2; ++i)
    {
  ***  * ***** *** *  *  **   ** *   *  ** * * *   *****  * * ***
**** ** *  *** ** ** *  *  ** **** * **      *** * *** 
  ** ** ***** *   *  **  *   * ****  **  * * * ** *  ** *  *  *  * **** **      ******* ** 
 ****       ** **  * * *  * * *  *** ** *****  ** *****  ********     **  ****   **
*  *** ** *    * * ** **  *    **      *   *    
    }
}

int main(void)
{
****** * * *** *   *  *   n;
  ***   * * * **  ** *    **  ** *      **** *** &n);
  * *** **   * * **  * (is_prime(n))
*  * ** ** * * * **   *  *  ***  *    **  *** ****  *  *   *   *** ** ** *   
** * *** *  * * * * *** *** **
  **  ****** *  *  **      *  *      *   *   * *   **  * * * ****  prime");
 * **** ****   *  *  ***  0;
}
answered by (-168 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Wrong output
Case 5: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>

int is_prime(int n){
int i,c;
{
  **  ** *  *  *   ** *  **    (i = 1; i <= n; i++) {
***** * **** * *  * **     ***    *** *** ** **** **** *  (n % i == 0) {
   **  **** * *   * *  *  *    *  * *   *** * * *  *** *** ****  ***   * *** *    * * 
 **  **** **** * ** * **  *   *    *** *    * *  **  ** ** ***
*  ** **   * *  *  ** * * **  
* **  *** ** *  **  * ****  * *  (c == 2) {
*  *   *  * * * ***  * ****  *   *   * * **  * ***   1;
* *    *  ****  *    *** ** *  
 ***   ** *   * * *  ** *   **  {
*  ***** **  **  *     ***  **  *  * * * * **** **   * * *   0;    }
    
}
*     * **  *  ***** ** ** * **  0;
}

int main(void)
{
***      ** ** * ** *** * *    ** n;
 **********  * * * **   ** *   **  * ** *** &n);
    ***     ******* **  *   (is_prime(n))    *  *****  ***   * *** ** *  ** * *** * *** *     * function return 1
     *  * **** * **  *  *  ** *  *** * **  *   * **    **    ** * **    *   *
 ***  **   *  *      *** ** **    ** **** * * **  * **  * *****    * ***  *** *    *   *  ***   *  ***  * **   *   * **    *    ** *** *   ***    * **  * * ** **  *  function return 0
 *** ***   **    ****  * * ** *    *   * * ** **  *  * **      * *****  prime");
***     ** * **   ** * **** * **   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
Case 5: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
int is_prime(int n)
{
** ***  *** **  **       **** **** **  j, flag = 1;
  ***  **  *    **** ***** **** **     
** **  ***** *    **  * *** **   0;

***  *  *       *** * *      * * j <= n/2; ++j)
*****     ***  **    * *** * 
* * *** ** * * **   * **   ********** *****   *  **** (n%j == 0)
 *  **  * *  *  ***   *    * ** * ** **   * * *   **  * 
     * * *** *******  * * ***  **     * **  **  ***** ** ****       **   *   **   =0;
****     * ** *    **  *** *** ****   * * ** **    *** **  * *** ******      * **  *
**   * **  *    ** **    *** ** ***  * *   *    ** *  
* ** ** ** **  * * *    **   **
 * *   *   **    *   *    *   flag;
*  *     * *  *   ** *  * YOUR CODE HERE*/

*** * *    * ** * **   *  *   ****  **
*  **   ****** *  *    * *  OF YOUR CODE*/
}

int main(void)
{
   int n;
 **    * ** ** *** *  ** ***  ***   **  ** &n);
   if (is_prime(n))   *   **      ****  ** * *  ** *  * **** *   function return 1
* *  * ** *   * **  *** **  ** ** * *   ** * **   ** ******  *
 * *** * *  ** *** * ***     *******   * ****  ***  *  **  * ***** **   ** ***  *    **  ** **** *   *****   *   *      *  **  ** * *   ** ***  ****    * function return 0
* ****  * **** * *  * ***    *** *  * *  *  **    *  *   prime");
 ** *****  ***** *  * 0;
}
answered by (-167 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Wrong output
Case 5: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
int is_prime(int n)
{
  *   * **** ****  *  * * cpt,a;
 * *        * *** * * * **    *
*  *** * *  *  * ** ****    *   **  **  (cpt=2;cpt<=n;cpt++)
***   *** * ** **   **** ** **   *  * * *  * *    *
 ** *****   **  *   **  *   * ** ***  * * *  *** *** *  **  ****** * ******   *  (n%cpt==0)
**   ** ** *      ** **** * **       *  ***** **    *** **** ****  **  ** ***   **
 ******* **   ***  *  **   **   *    *   *      ** ****     **  ** * ** ** ** *****  **** ** **  *  **   
*  * * * * **   *  *   **  **         ****** **  ***   *   *** *  * ***   * * *  ** *** 
* * ***  *    * * **      **** ** *  *   ** **** *
*  *    **    * *  *  *  ** * ****  ** **   *  *     (a==1)
** ** ******** * ****   * *** *  ***  * ***  *  * *** 
 ** *  *** ***  *  **   * *  **** *  ***  *   ** * *    *  **  * ***      ***** *  *  * *** 1;
      *** * * *  * **   *** ****** ***** **** *** 
* ****  *  *** ** *  * ** ** *  ** *** * ******   ** *   **   *  0;}

  *  * * ** *** * ***   * YOUR CODE HERE*/

 **     **** **  ** *    ***       *    ** * 
   /*END OF YOUR CODE*/
}

int main(void)
{
   int n;
 *  *      ***   *   *    *  * * *******   &n);
   if (is_prime(n)) * * * ** *    *   * ****  *   *      **   *   ** * * ****** function return 1
* *** *** * **   *   *  ***  *   *** * *****  *  * **** ***  **
   else ***  * **  * *** ******* * *** *** * **** *    *     * ** * **  **** *   *   **   * * *** *****    * *  * ** ****** * *** *  * * **    function return 0
  * * *** ** ** * ****    ** ****    ***** * ** ** * prime");
   return 0;
}
answered by (-168 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output
Case 5: Correct 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.71.254.145
©2016-2024

Related questions

0 like 0 dislike
47 answers
12-07 Exercise 3: Function to delete an element from an array
[Exercise] Coding (C) - asked Dec 7, 2017 in Chapter 9: Functions by semicolon (5.2k points)
ID: 35785 - Available when: 2017-12-07 18:00 - Due to: Unlimited | 1.5k views
0 like 0 dislike
45 answers
12-07 Exercise 2: Function num_digits
[Exercise] Coding (C) - asked Dec 7, 2017 in Chapter 9: Functions by semicolon (5.2k points)
ID: 35784 - Available when: 2017-12-07 18:00 - Due to: Unlimited | 1.9k views
0 like 0 dislike
99 answers
11-01 Exercise 1: Find out all prime numbers between n and m
[Exercise] Coding (C) - asked Nov 2, 2017 in Chapter 6: Loops by semicolon (5.2k points)
ID: 29829 - Available when: 2017-11-02 18:00 - Due to: Unlimited | 2.8k views
12,783 questions
183,443 answers
172,219 comments
4,824 users