0 like 0 dislike
13.4k 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: 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 | 13.4k views

70 Answers

0 like 0 dislike
Hidden content!
#include ** ** * * *
int * *** *** n)
{
* * ********** * ** ** * YOUR CODE HERE*/

*** * * * ** i;
** ** * ** * ** * ******** **
*** **** * * ***
*** * *** * ** * * * * *** * * **** if(n%i!=0)
* **** *** * ** * ** **       {
* ** ** * *** * **           return 1;
* ** *       }
* *       else
** **   ** * *** * {
** ** ** * * * * * * ** * * *** return 0;
**** * * * *** * * ** }
* * *** ** * **
** * * ** * *** *
* *** ** * * *** *
* * *** * * ** * * * return 0;
* * ** * * *
* * * ** ** *
**** * ** * * *** *
* ** * * * ** **** * ****** return 1;
* *** ******* * **

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

int * *
{
** *** * * * ** * n;
*** * *** ** ***** * * * * ** * * *
*** ** ***** *** * ** ********* * *** ** * * **** *** ** * * ** * * function return 1
* * **** * ** *** ** * * * ** * ** * ***** * *** *
* *** * *** * * * * * * * * * ** ** * ***** * * ** * ** * * *** * * ** **** * ** ** * * ** * * ** function return 0
* ** *** *** * * * * * * * *** *** * ** *** * *
* ** ** ******** * ** 0;
}
answered by (-249 points)
edited by
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
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
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
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
0 like 0 dislike
Hidden content!
#include *** *
int ** * n)
{
* ** * ****** * * YOUR CODE HERE*/

***** * *** ** * * ** int i;
** * ***** ** * * * if(n==2)
* * * ** ** *** ** ** {
* ** * ******** * * ** * **** ** return 1;
** ****   }
** * * * * *** * ****   * *** * *
***** ** ** ****   {
* *** * * * ** **       if(n%i==0)
*** ** *** **** ***   * ****** * * * * **
*** **** *** ** ** ** * * * * * return ***** *** *
* * *** * ** **** }
* * ** *  
  *** }
* * * return 1;
* *** * ** **** *** ** OF YOUR CODE*/
}

int main(void)
{
**** ** * * ** ** n;
* ********* * * * * *** * ** ***
* * ** ******* * * ** * ** * ** * ** ** * * * ** * * function return 1
* ***** ** * * ** * * ** *** ** *** * *** ***
*** ** * * *** ** ***** * * **** ** **** * *** ** ** * **** *** ** *** * ** * * ** * * ** * * * * ** **** * ** * * * ** * function return 0
***** * *** * * ** * * * *** * ** *** *
* ** * * * ***** * 0;
}
answered by (-249 points)
0 0
Case 0: Wrong output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Wrong output
Case 5: Correct output
0 like 0 dislike
Hidden content!
#include <stdio.h>
int is_prime(int n)
{
** * *** ** **** * * ** j, flag = 1;

* * ** ****** ***** 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: Wrong output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Wrong output
Case 5: Correct output
0 like 0 dislike
Hidden content!
#include * * * * ****
int * * n)
{
** ****** ***** ** ** * * YOUR CODE HERE*/
* * * * ** ** int i;
* * * ** ** int p=1;
* ** ** * * * * ***
** ** * ** * {
*** * * * ****** * * * * * ** ** * * *
***** * * * * ** * * {
* * * * * * ** * *   ****   return 0;
* ****       }
* * *     ** * * * * *
* ** *** *** ** *** {
** ** * * ***** * ** * *** * * * * ** * p=0;
** ** ** * **** **** * ** }
* * **** * *** * * return p;
****** **     *
** * **** * }
** * * * * **
** * * ***** ** * OF YOUR CODE*/
}

int main(void)
{
**** * ** **** ** n;
* *** ** * * ** * * **** * * * *
***** ** *** * ** * ** *** ** * * * * * ** * * ** * ** function return 1
** ** * * * * ** * ** ** ** ** ** * *** * * ** *** ****
* *** *** ** * * * * ** ** * ********* ** *** * * * * ** ** * * **** * ** **** ** * *** ** * * * ** * **** * *** function return 0
* * ** * * * * * ** ********** * * * * ******** **** ***** *
* ****** *** *** ** 0;
}
answered by (-249 points)
0 0
Case 0: Wrong output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Wrong output
Case 5: Correct output
0 like 0 dislike
Hidden content!
#include **** ** ** **
int * * n)
{
*** * *** * *** ** * YOUR CODE HERE*/
* *** * **** int i;
** *** * * * int p=1;
* * ***** ** *** * ***
* **** ** *** {
* ** * * ** ** ** **
* * ** * * ** ** * *** {
** * * *   ** ***   return 0;
* **       }
*     **** *****
* * * * ** * ** ** {
** * * **** * *** ** ** * *** ** p=0;
* * * ** * ** * }
* ** * * ** * return p;
* *     *** *
* *** * * *** }
** ***** ** ****
* ** ** ******** ***** OF YOUR CODE*/
}

int main(void)
{
* *** * *** * * n;
**** ** * *** * * ** *** * ** * *****
* * *** ** ** * ** * ****** * ** ** * * * * ***** * ***** ** * function return 1
** * * * * * * * *** * *** * *** ** *** * *****
* * ** * * *** * ***** **** * **** * * **** ** * * * * * * * * * * ** * ** * *** *** *** ** **** ** * * ** ** *** * **** function return 0
* **** ** ** *** ** *** ** ** ** * * ** ***** ** ******
** * * * ** ** ** 0;
}
answered by (-249 points)
0 0
Case 0: Wrong output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Wrong output
Case 5: Correct output
0 like 0 dislike
Hidden content!
#include * *** * **
int * * n)
{
** **** * ** *** *** * YOUR CODE HERE*/
*** **   int i;
***   int p=1;
* * * * * * ** * **** ** *
***   {
* *** *       if(n%i==0)
** *   * * * * *** * {
* ** * * * * * *** * * ** ** ***** * ***** p=0;
* ** ***** * ** * }
*** * ** * * ** * * ** return p;
**** **** * ** * ** *
* *** * ** }
*** ** **
* ** ****** *** * * ** OF YOUR CODE*/
}

int *
{
** ** * * * ** ** n;
**** * * *** ** ***** ** * ** ** *** * **
** ** * ** * * * *** ** * ** * * * * * *** * *** *** * function return 1
**** * *** * *** * **** ** * * *** ** ** **** **
* * ** * * *** ********* *** ** * * * ** * * ** * ** **** *** * ****** *** *** ***** * ** * * ** ** * * *** * ***** * ** ** * ** * * function return 0
** *** * * ** **** * *** * * *** ** ** * * * **
* ***** ** * * **** 0;
}
answered by (-249 points)
0 0
Case 0: Wrong output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Wrong output
Case 5: Correct output
0 like 0 dislike
Hidden content!
#include <stdio.h>
int is_prime(int n)
{
*** *** ** ** * * ***** ** ** YOUR CODE HERE*/
** * * * * ** * * * i;
**** * * * * ** ** ** * === 1 || n == 2 || n == 0)
* ** * ******* *** ** * ** ** ** * *** 0;

*** ***** *** ** * *** * **
** ** * ***** * ** * * * * **** * ** * (i=2; i<n; i++)
** * * * ** * * ** ** * * * ** * * ***
****** *** ** * * * * ** * ***** * ** * * * ** ** **** ** (n % i == 0 && i != n)
* * * *** * * * * * * * * ** ** ** * ** **** * * ** * ** * ** *** * * ** * * 0;
** ** *** * * **** * ** *** **** * * * ** * * * * *
    }
* * ** *** * ** **** **** 1;
* ** * * * * * OF YOUR CODE*/
}

int main(void)
{
* * * * * *** * ****** * * * n;
* ** * ** * ** ** **** *** &n);
* *** ** * **** * *** * * (is_prime(n)) * * * ** * * * ******* * **** *** * *** * function return 1
* * *** * *** * ** * **** ******* * * * ** ** * ** *** *
** * * **** ** ***** * * ********* * **** * * ** * * * *** *** ** * ** **** * * **** * ** *** ** * * ** * ** ***** * ***** * *** * function return 0
* * * * * ** * * ********* ** * *** **** prime");
* * * *** *** ** * * * 0;
}
answered by (-233 points)
0 0
prog.c: In function 'is_prime':
prog.c:6:12: error: expected expression before '=' token
     if(n === 1 || n == 2 || n == 0)
            ^
0 like 0 dislike
Hidden content!
#include <stdio.h>
int is_prime(int n)
{
* ** * *** * * ** * i;
** * ** * **** ***
** ** * * ** **** * **
* ** **** * ** *** *** ** ** **** ** 0;
** *** ***** ** ** ** 1;
}

int main(void)
{
** * ** **** * *** n;
** * *** ** ** ** * ** ** * ** &n);
** **** *** * * ** (is_prime(n)) * *** * *** ******* ** ** ** * * * ***** ** function return 1
* **** * * * *** * *** **** **** *** ****** ** * ** **
*** ** * ** * ***** ** * ** * ** **** **** *** *** *** * * ****** * ** **** * * ** * ***** ** * *** *** ** **** * * * * ***** ** **** function return 0
****** ******* ** *** **** * * * **** ** *** * * prime");
* ** *** ** ** ** 0;
}
answered by (-16 points)
0 0
Case 0: Wrong output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Wrong output
Case 5: Correct output
0 like 0 dislike
Hidden content!
#include <stdio.h>
int is_prime(int n)
{
* * ** ** * ** * i,ans;
**** ** * **** ** ***
   {
** * ****** * ***** * ** * ****** * ****** ** ****
* ** * * * *
*** ****** ** ***** * ******** ** * *
*** * * *** ** * *** ** ** * * * * ** *
* * **** * * * * * ** *** * **** **** * 1;
*** * ** ******* ** *** * if(ans==0)
* ** * *** *** ** ** * ** * * * * ** *** * 0;
   }
   }
** ** * * * * **
* *** *** ** ******** * * * 0;
}
int main(void)
{
*** * **** **** * n;
* ** ** ****** * *** * ** **** *
* ** * * * * * (is_prime(n))
* * * ** *** * *** * * ** ** * * ** ** * **
** *** * * ** **
** ** * *** * ****** * * * ** * **** ** * ** *** prime");
** * *** ****** ** * 0;
}
answered by (-258 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
0 like 0 dislike
Hidden content!
#include <stdio.h>
int is_prime(int n)
{
* * * * * i,ans;
****** ** * ** ***
   {
* ** ** ** ****** * * * ** * * * ** **
* **** * *** ** *
** **** ** * * **** * * * ** **
** * * *** **** * ** ** * ** ** * * **
** * * ** * ** * *** * ** * ******* **** * * * 1;
* * *** * * * * * ** * * * * if(ans==0)
* * * ** **** * **** ** * * ** * ** *** **** ** 0;
** * ****** * ****
   }
}
int main(void)
{
* ******** ** ** * * n;
** *** * **** ** *** * *** * *
* ** ******** * * (is_prime(n))
** * * * ** ** ** ** *** * ******* * * ** * ** *
*** * * ** *
*** * **** * * * * * * **** * * **** * prime");
*** * *** * ** * ** 0;
}
answered by (-258 points)
0 0
Case 0: Wrong output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Wrong output
Case 5: Correct output
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.70.80.21
©2016-2025

Related questions

0 like 0 dislike
47 answers
[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
| 9.3k views
0 like 0 dislike
45 answers
[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
| 9.2k views
0 like 0 dislike
99 answers
[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
| 20k views
12,783 questions
183,442 answers
172,219 comments
4,824 users