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

70 Answers

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
0 like 0 dislike
Hidden content!
#include * ** * * * ****
int is_prime(int n)
{
* ** * * ** * *** ***** YOUR CODE HERE*/

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

int main(void)
{
* *** ** ** n;
*** * * * * ** * * * *** ** &n);
***** * *** * * * ** **** (is_prime(n)) ** ****** ** ** ** * ** * * *** *** * *** ** ** * * * * function return 1
*** * * * *** * * * * * * * * * * ** * * ***
** **** *** * *** * * *** * * * ** ** ** ** *** * *** * * ** * * * ** * ****** ** *** * ** ** * * * *** ** ** * *** * * ** ***** *** function return 0
* ** ***** * * ** * * ** ***** ** prime");
** ** ** * * ****** 0;
}
answered by (-258 points)
0 0
Case 0: Wrong output
Case 1: Correct output
Case 2: Correct output
Case 3: Wrong output
Case 4: Wrong output
Case 5: Correct output
0 like 0 dislike
Hidden content!
#include <stdio.h>
int is_prime(int n)
{
** *** * *** *** ******* i,flag = 0;
*** *** ** ** * ** * **
   {
* ** * * **** * ** * * ** * * * * ** 0;
   }
** ** ***** ** ** * * * * ** *
   {
* * ** * * * * * * ** *** * ** **
* ** * ** *** * ** * *** **** **** **
* *** *** ** ** ***** * * ****** * *** * ** *** *** * * * * * * = 1;
* **** ** * * *** * ** * * * *** * * **** *** * ** ****
* * * *** ** **** * * * *** *** ** * *** *** *
   }
*** * * ** * * *****
   {
** * *** * * * * ** *** ** *** ** * 1;
* * ** * * * * * *
* ** * *** * *
********** *** ****
** * * * * * * * ** ** *** * * ** **** 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
0 like 0 dislike
Hidden content!
#include <stdio.h>
int is_prime(int n)
{
**** * ** ** ** *** i,flag = 0;
* * *** * * * ** *** ** * *
   {
** *** * **** * * * **** * * * ** * ***** **
***** ** * ** *** * * * *** *
* * *** ** * * *** ******** * * * ** **** *** *** * ** ** * =1;
* * **** * ****** * ** * * * ** * * ** * ** * * * * **** * ** ** * *
*** * ** * ** ** * * * * *** * ** *
   }
*** * * * *
   {
****** * ** ** * ** *** * ******* ** ** ***** *** 1;
   }
* ** ******** * ** **
* ** * * * ** *** **
* * *** * * * * * ** ** * ** **** * * * * *** 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: 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 is_prime(int n)
{
 int a;
 if (n<=1)
** * ** * 0;
** ***** * ** *
* *** ****
* * ** * * ** * *** ** * * (n%a==0)
**** *** * *** ** *** * * * *** *** * ** * * **** *** 0;
* * ** ***
return 1;
}

int main(void)
{
* * *** ** ** n;
** ** * * * * ** **** * * &n);
* ** ** ** *** * (is_prime(n)) ** * * * ***** * ** **** * *** *** ** ** * function return 1
********** * * * * * * * * *** ** * ** ** * ** **
* ** *** ** * *** ** ** * *** * **** * *** * ******** ** * * ****** * ** * ** ** *** * * * * **** **** ** *** * * function return 0
**** * *** ** ** * * ** **** ** ** ** * prime");
*** * ** *** *** ** 0;
}
answered by (-284 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 ** *** *
int is_prime(int n)
{
 int a;
 if (n<=1)
* ** 0;
** * * *** ** * ** * * **
** * *** **
** ** * * ** * ** * ** * *** * * (n%a==0)
** **** * * ** * * * * * * *** * ** ** * 0;
*** ****
return 1;
}

int main(void)
{
* * ** * * ** * n;
** * ***** ** ** * *** * &n);
** ********** ** (is_prime(n)) * *** ** **** * ** * ** * * ** **** ** ** * function return 1
** **** * * * * **** **** ** * * * ** * *** * * ***** *******
** **** * ** * ****** *** * * * ** *** *** * ** **** ** *** ** ******* * * ** **** * *** ** * ** * ** * ***** ** ********* ** * function return 0
* **** * * * * ** * *** ** * ** ** * prime");
* * * * * * * ** *** 0;
}
answered by (-108 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 * * * ** ** * *
int is_prime(int n)
{
 int a;
 if (n<=1)
* * ** *** 0;
** ***** ** ** * * *
* * *
* ** **** * * * * *** ** ** ** ** * (n%a==0)
* * * * * *** **** * **** * * * * ** 1;
* ** ******
return 0;
}

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

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

int main(void)
{
***** * **** ** **** * n;
* * *** **** * * * * * * * * &n);
* ** * * ** * * * (is_prime(n)) *** ** * * ** * ***** ** ********* ** * * ** function return 1
* *** ** * ** * ** ***** ** * * ** * * ** * * *
* **** * ****** ** * ** ** *** * * ** *** * ** ** * *** *** *** ** * ** * ** * ** *** * *** *** *** * ** *** **** *** * *** * * ** function return 0
* *** * * * **** * ********* *** *** ***** **** prime");
* * * * ** ** * * * * 0;
}
answered by (-304 points)
edited by
0 0
prog.c: In function 'is_prime':
prog.c:6:8: error: stray '\302' in program
  int d;\xc2\xa0
        ^
prog.c:6:9: error: stray '\240' in program
  int d;\xc2\xa0
         ^
0 0
prog.c: In function 'is_prime':
prog.c:4:9: error: stray '\302' in program
   int d;\xc2\xa0
         ^
prog.c:4:10: error: stray '\240' in program
   int d;\xc2\xa0
          ^
0 0
prog.c: In function 'is_prime':
prog.c:4:9: error: stray '\302' in program
   int i;\xc2\xa0
         ^
prog.c:4:10: error: stray '\240' in program
   int i;\xc2\xa0
          ^
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)
{
* * * * * *** YOUR CODE HERE*/
*** * ***** a;
* * ***** * *** ** ** * * * *
* ** ** * *** * **** ** ** ** (n%a==0){
** ****** ** ** * ** * ** * ** * **** ***** ** ** **
** *** * * ** * *** ** ** * ***
   }
** * * * * * ****
* * * ** ****** * ** * *** **** 1;
   }
*** * * * *** * {
* ** * ******** *** ** ** ** * ** *** 0;
   }
* * *** ** * * *
* * * * ** *********** * *** *** ****
* *** ******* ** *** OF YOUR CODE*/
}

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

*** ** **** *** * * (n<=1)
   {
** ** * *** ** ** * * *** *** ** * ** * ** ** 0;
* * ***** ***** *
* * * ****** ** ***
* **** ** * * *** ** ***
* *** ** * *
** ** * **** **** * * * * **** *** * **
* **** * ** * ** *** * ** * * * ** ****
** *** * * ***** ***** *** * (flag==0 && n!=i)
* **** * **** * * * * * * ** *** ** *** *** *
*** * * * ****** * ** ** **** ** ** * *** * * * ***** 0;
* **** ** * * *** *** ** ** * * ** ****
*** * ** *
*** **** * *** *** (flag==0 && flagb==1)
*** *** * ** ** *** * 1;
}

int main(void)
{
** * * ** ** ***** n;
*** * * * * * * * * * * *** * * * * &n);
***** ** ** * ** (is_prime(n))
* * ***** * * * *** * ***** ** * *** * ** ***
* * * ****** *
*** **** * ** * ** *** ****** * * * ** * **** prime");
* ******** * ******** * * 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
Case 5: Correct output
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:104.23.211.236
©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
| 7.9k 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
| 8.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
| 17.1k views
12,783 questions
183,442 answers
172,219 comments
4,824 users