0 like 0 dislike
8.3k views
請設計一個程式,讓使用者輸入兩個正整數a以及b(a <= b),從小到大輸出a到b之間的所有質數。

範例輸入:

1 10

範例輸出:

2 3 5 7
[Exercise] Coding (C) - asked in 作業 by (18k points)
ID: 13617 - Available when: Unlimited - Due to: Unlimited
| 8.3k views
0 0
Called for Help
0 0
Called for Help
0 0
Called for Help

91 Answers

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

#include <stdlib.h>



int main(void)

{
* ** ** ** * * * * n,i,s,t;
* * ** ** *** * ** ** ** *** ***** * ***** *
* ** ** ** ** ** *** * (s == n;s <= i;s++)
** * **** * * * ***
* * * ****** ** *** * *** * * * (t=2 ;t < s;t++)
* *** * * * * *** * ** * * ****** ** *
** * * * ** ** * ** ** * * * * *** * * * * **** == 0)
** **** * * ** ** ** * * * * ** ** ** ** ****** **
**** * * * **** * ***** ** * ********** * ** *****
* *** ** *** ** * *** * *** ** * * * * (s == t)
* * * * ** * ** * * * * **** * * * *** * * **** ** *** ("%d ",s);
** ** * *** * * * * * ** *

return 0;



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



int main()

{
*** * * * a, b, j, k;
* * ** *** * ** ** * ** *** ****
** * * ***** * = a;j <= b;j ++)
*** ** * *** *
***** *** *** * * = 2;k < j;k ++)
* ** * *** * *** *** * * * ** * % k == 0)
* * **** *** * *** * * **** * ** * * * *****
** ** * * * *** * *** == j)
**** * ***** ** *** ** * ** ******** *** * ",j);
* * ********
********* **** * 0;

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



int main()

{
*** ** * * *** a, b, j, k;
** ****** ** * **** ** * *** * *** * ***** ****
*** * * * * = a;j <= b;j ++)
* * * * **
** ****** * **** ** ** * = 2;k < j;k ++)
* * * * **** ** ** ** ** * % k == 0)
** *** * * **** *** * ** * ** * * *** * * * * * *
*** ***** ***** ** >= j)
* ******* **** ** * ************** * **** * ",j);
**** * * ** ****
* ** * *** ** * 0;

}
answered by (18k points)
0 like 0 dislike
Hidden content!
#include * ***** *** ***



int main()

{
*** * * ** * * * num1 ,num2 , j ,k ;


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


*** ** * * * ** ** ( j = num1 ; j <= num2 ; j ++ )
*** * * ***


* ** ** * * * * *** * *** *** ( k = 2 ; k < j ; k ++)
**** ** * * ** * ** * * **** ** ****
* * * * * * * * ** * ***** * ***** * *** * (j % k == 0)
*** *** * ***** * ** ** * * * * *** * ** * * *
** ** ****** *** *** ** * *


** **** **** * ** ** (k == j )
*** * *** ** * **** ** *** ** *
** * * *** * ** *

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



int main()

{
*** * * * * a, b, j, k;
* ** ** ** *** ** * * ** * * *
* **** ***** * = a;j <= b;j ++)
* * ****
** * ****** *** * ** = 2;k < j;k ++)
* *** ** * * ****** *** * ***** ** % k == 0)
* *** * ** *** * ***** **** *** ** * ***** ****
* * ** * *** *** * * * * >= j)
** * * * *** * * * *** * * * *** * ** ** * ",j);
* * * ** *
* *** * ** 0;

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



int main()

{
** * ***** *** * ** a, b, j, k;


* * * * ** ** ** * ** * , &a, &b);
** *** ** * *** ** = a;j <= b;j ++)

   {
* * ** * * * * * ** *** ** * * = 2;k < j;k ++)
** * *** * **** * ******* ** ***** ***
** * ** * ** ** *** * * ** * * **** * ** * * ** ** ** * ***** * % k ==0)
* * * *** * * *** *** *** * * ** ********** ** * * * *** * * ***
* * ** * * * *** *** *** * * *** *
****** * ** ** * ** * * ** * ** ** * == j)
* * ** ** * * * * * ** * * * * ** **** *** ** * *** j);


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

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



int main

{
**


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


*** * * *****

{
* * * * *

{


* % d == ***



}




* * == d ** * ** * *** * ** ****** * ** * **



}




* 0;

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



int main()

{
* ** *** * * **** a, b, j, k;


* * ** *** * **** *** **** ** , &a, &b);
***** * * ** = a;j <= b;j ++)

   {
* * **** *** * ** * ** * ** ** * = 2;k < j;k ++)
** ** **** **** **** * ** * *
* ** * *** * * **** * * * * * * * **** * * ** % k ==0)
******** ** ** ** * * * * * ** * * * ** * ** * ** * * * * ** ***
** *** ** *** *** *** * * * * **** * *** *
* *** * * * ** * * ** * * *** * * **** == j)
****** ** ** ************ * *** *** ** * ** * *** ** * *** ** ** j);


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

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

int main()

{
* ** ****** a,b,j,k;
*** *** **** * ** ** * * * * *** ** * * *


* * ** *** ** * b;j++)
* * * **** **
** * ** * ****** *** ** **** (k=2;k< j;k++)
* * ** ** **** ** ** * **** ** * * (j%k==0)
** * * *** * ***** ** * *** **** ** * ** **


**** * ** ** (k >= j)
* *** * ** ** * **** *** * ",j);
* * **** ***
* *** ** * * * ***** * 0;

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



int main()

{
** * * * * * a, b, j, k;
** *** **** ** * * *** *** * * * * ** **
* **** * * = a;j <= b;j ++)
** ** * *
* *** *** * * * * * * * * = 2;k < j;k ++)
*** * **** *** *** ** **** ** * * % k == 0)
** ***** * * ** *** * * * ***** ** ** ** ** **
* * * ** ** ** * >= j)
* *** * ** * **** ** * ** **** ** ** * ",j);
* * ** * * **
* * *** * * * * 0;

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

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
| 5.9k 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
| 6.2k views
0 like 0 dislike
117 answers
[Exercise] Coding (C) - asked Oct 13, 2016 in 作業 by Shun-Po (18k points)
ID: 13581 - Available when: Unlimited - Due to: Unlimited
| 9.7k views
1 like 0 dislike
48 answers
[Exercise] Essay (Open question) - asked Nov 2, 2016 in 作業 by Shun-Po (18k points)
ID: 16865 - Available when: Unlimited - Due to: Unlimited
| 5.4k views
0 like 0 dislike
76 answers
[Exercise] Coding (C) - asked Oct 19, 2016 in 作業 by Shun-Po (18k points)
ID: 14120 - Available when: Unlimited - Due to: Unlimited
| 7.5k views
12,783 questions
183,442 answers
172,219 comments
4,824 users