|
发表于 2016-10-7 14:11:28
|
显示全部楼层
本帖最后由 TimCheng 于 2016-10-7 14:15 编辑
我也是初学者,写了一个效率不高的代码,Array存储所有的素数
- #include <stdio.h>
- void main()
- {
- printf("This program will check the prime number between 2-100\n\n");
- int Number=2, Count=0, Array[99], sign = 0;
- printf("Print prime number between 2-100\n");
- //When Number == 2
- if(Number == 2)
- {
- Array[Count++] = Number;
- printf("%d ",Number);
- Number ++;
- }
- //When Number != 2
- for(;Number<=100;Number++)
- {
- sign = 0;
- for(int i=2;i<Number;i++)
- {
- if(Number%i == 0)
- {
- sign = 1;
- i = Number;
- }
- }
- if(sign == 0)
- {
- Array[Count++] = Number;
- printf("%d ",Number);
- }
- }
- //Print Array
- printf("\n\nNow Print Array:\n");
- for(int i=0;i<Count;i++)
- {
- printf("%d ",Array[i]);
- }
- //Stop Here
- getchar();
- }
复制代码 |
|