0 like 0 dislike
12.6k views

質數(Prime number),又称素数,指在大於1的自然数中,除了1和該数自身外,無法被其他自然数整除的数(也可定義為只有1與該數本身两个因数的数)。 大於1的自然數若不是質數,則稱之為合數。 例如,5是個質數,因為其正因數只有1與5,而6則是個合數,因為除了1與6外,2與3也是其正因數。

 

請寫一個程式,讓使用者輸入一個正整數,程式會判斷這個正整數是不是質數。

 

輸入範例1:

9

輸出範例1:

not a prime

輸入範例2:

2

輸出範例2:

is a prime

[Exercise] Coding (C) - asked in 作業 by (18k points)
ID: 13581 - Available when: Unlimited - Due to: Unlimited
1 flag | 12.6k views
0 0
Called for Help
0 0
Called for Help
0 0
Called for Help

117 Answers

0 like 0 dislike
Hidden content!
* * **** ** * ** *
*** ** * * * ** *
** *

{
** * *
* * ****** * ** ***
** * *** * ****

* *** *

{
* *** * **** a * * * *
** *

}
**
* *** a * ***
* ***

}































}
answered by (-248 points)
0 like 0 dislike
Hidden content!
* * * *** ** * * **



int * ***

{





{

int ** *
****** * * * ****** ***
* ** ** *

{
* ** ***

{
* ** *
*** * *

}

}
* **** ** * ** * *******
****** * a * * ****

else
* ** * ** a * ****

}


* * 0;

}
answered by (-50 points)
0 like 0 dislike
Hidden content!
****** * * ** * *
*** *** ** * * ** * *



int main()

{

int x, i,k=0;
***** ** **** * ** * ** *

for * ***** ***

{
** * * * ** x % i ==0)
*** * ** ** * *
** * * **** * ** a ** *** ***
*** ** * *** **
* ** ** *
* * **



}

if (i==x ** ** * ** k==0)
** ** * *** *** * a ** *****

}
answered by (-34 points)
0 like 0 dislike
Hidden content!
* * ***** * * *
***** **** * ** **

  int main()

  {
***** * ***** ** ** * * i, num, k = 0;
**** * * * * * * * *** * ** * * * **
* **** *** *** * (i = 2;i < num;i ++)
* * * ** ** **
**** ***** * * * ****** ** ** * ****** * **** * * % i == 0)
** * ***** * **** * * ** ** * * * *
* ****** ****** ** ** ** * ** ****** * * * * = 1;
* * **** *** * **** ** ** *** ** *** ***** ** * * ** * * * ** **
*** ** * *** * * * *** * * * * **
* * *** ***** * ** **
* * ** *** * * * * * ** = 1 && num > 1)
* * * ********* * ** * *** **** **** ** a prime");
** * ** * * * ** * *
* ** * ** ** ** * ** * * * *** ** * * a prime");
** ** *** * ** *** * *** ** ** *** 0;

  }
answered by (46 points)
0 like 0 dislike
Hidden content!
**** *** *** ***
* **** * *** * ** * **


* * main * ***

{

int * ** *


*** ** ***


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

{
** % b == * * = * **



}
* ** == 0 * ** ** ** * *** ** * * * * a ** * **
* * ** * a *** ** **


*** * 0;

}
answered by (-276 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>



int main() {

    
* ** * * ** *** ** **** * a=0;
* * * * * * **** ** ans=1;
*** * * * * ** * ** *** i;

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

    
**** **** * * ** * * * *
***** * * * ** * * ** ** * * * ** ****** *** a%i == 0 ){
*** * * ** * ** ** * * * * * * *** * * * *** * * * ** * *** ****
* ** ** * * * **** *** * *** ** * * ** * * * * * * ** *** ** * **
* * * * ** * * * **** **** * ** ***
* *** * ** ****** *

    
* * ** * **** * ******* ** * ** (ans) {
*** * * * ***** * * **** *** ** *** * ** ** ** 1:
* * * *** * * * ** ******* * * *** ** ** * * ***** *** * * ** * ******* a prime");
* * **** ** ** * * *** ** ** * ** ** ** ******* * *** ** *****
* ** * * ** * * * * ** ** * * ** * * 0:
** * * ** * **** * ** * * * * * * ** ** *** * *** * ** * * * ** * *** a prime");
** *** * * * ** *** ** * **** * * ** * ** ***** ** ** * * ** *

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

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



}
answered by (-126 points)
0 like 0 dislike
Hidden content!
# include <stdio.h>

int main()

{
* * * * * * ** num ,j,k=0;
* *** ** * * * * * * * * **** *
*** ** * * * ** ** ** * *
* * *** *** *
** * * * *** ** *** * * * ** * * (num % j=0){
* * * * *** * * * ** ** ** ** ***** *
**** ** * * * *** ** **** *** * ***
**** * *** *** ******* *** *

   }


**** *** ** ** ** *** * * * num >1){
** * ***** ** ** * * * *** * * ** ** a prime");
**** ***** **** * ****


* ** * **** * * * **** *
* * ** * ** * * *** ** * * * *** *** a prime");
* * **** * ** * *


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

}
answered by (-82 points)
0 like 0 dislike
Hidden content!
#include * ** *********

int main()

{
** * * ***** n , j ,k = 0;
*** ** * * ***** ** ***** **


* ** ** ** ** *** ** (j = 2;j < n; j ++)
* ***** *** **
** *** * *** ** * ***** ** ** % j == 0)
* *** * ** * * *** *
* * *** ** * * * * * * * *** * *** * = 1;
*** *** * ** ** * ** ** ** * * * * *** **
* * ** * *** ** * ****** ******
** ** ** *
* * ** * *** (k == 0 && n > 1)
* * * *** *** ** * * ** * *** ** a prime");
** * ** *** * **
* *** ** * * ******* ** not a prime");
*** * ** ** 0;

}
answered by (43 points)
0 like 0 dislike
Hidden content!
** **** ** ***
** * *** * * * * * * *
*

{

int **
* * *** * * ***** * **
*** * * * **

{
*

{
*


}

}

** ****** ** a ** ********
* * *** ** * * ***
* *** * a ** *** * *































}
answered by (-248 points)
0 like 0 dislike
Hidden content!
#include<stdio.h>
* *** ** *** *



int main()

{
** * * ** ** * a,b,c = 0;


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


** * * ** ** * = 2;b < a;b++)
* ***** * **** ** *
*** *** * * **** * * *** * * *** % b == 0)
** * * ** **** * **
* ***** ** * **** * * = 1;
* ** ** * *** ** **** * * *** *** * ****
* * ** ***** ****** * * *** *
* * * **** ** *** *
* * * *** * ** == 0 && a > 1)
* * * ** ****** * ** * * a prime");


** ** * * **** * *
** * * ****** * *** ** a prime");


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

}
answered by (-124 points)
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.69.7.77
©2016-2026

Related questions

0 like 0 dislike
64 answers
[Exercise] Coding (C) - asked Oct 13, 2016 in 作業 by Shun-Po (18k points)
ID: 13763 - Available when: Unlimited - Due to: Unlimited
| 7.8k views
0 like 0 dislike
61 answers
[Exercise] Coding (C) - asked Oct 13, 2016 in 作業 by Shun-Po (18k points)
ID: 13736 - Available when: Unlimited - Due to: Unlimited
| 7.9k views
0 like 0 dislike
91 answers
[Exercise] Coding (C) - asked Oct 13, 2016 in 作業 by Shun-Po (18k points)
ID: 13617 - Available when: Unlimited - Due to: Unlimited
| 11.3k views
2 like 0 dislike
44 answers
[Exercise] Coding (C) - asked Nov 2, 2016 in 作業 by Shun-Po (18k points)
ID: 16861 - Available when: Unlimited - Due to: Unlimited
| 6.7k views
1 like 0 dislike
129 answers
[Exercise] Coding (C) - asked Oct 19, 2016 in 作業 by Shun-Po (18k points)
ID: 14119 - Available when: Unlimited - Due to: Unlimited
| 14.7k views
12,783 questions
183,442 answers
172,219 comments
4,824 users