|
[x]
Posted via EE Mobile
|
||
Search, ask, and monitor your questions on the go with EE Mobile. Visit Experts Exchange from your mobile device and never be out of touch again. |
||
| 10/23/2009 at 10:01AM PDT, ID: 24838601 |
|
[x]
Attachment Details
|
||
|
[x]
The Solution Rating System
|
||
With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.
Your Input Matters If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support. Thank you! |
||
1: 2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12: 13: 14: 15: 16: 17: 18: 19: 20: 21: 22: 23: 24: 25: 26: 27: 28: 29: 30: 31: 32: 33: 34: 35: 36: 37: 38: 39: 40: 41: 42: 43: 44: 45: 46: 47: |
/* Finding Prime Numbers Using The Sieve Of Eratosthenes*/
#include<stdio.h>
#include <stdlib.h> /* for the malloc() function and exit() function */
#include <assert.h> /* for assert macro */
int main(int argc, char* argv[])
{
FILE *fp;
int num[10000], i, j;
if (argc != 2) {
printf("Usage: SeiveErat.exe output.txt \n");
exit(1);
}
fp = fopen(argv[1], "w+");
for(i=1;i<=9999;i++)
num[i]=i+1;
for(i=1;i<=9999;i++)
{
if(num[i]!=0)
{
for(j=(i+1);j<=9999;j++)
{
if(num[j]!=0)
{
if((num[j]%num[i])==0) /*check if num[j]*/
num[j]=0; /*is a multiple of num[i]*/
/*if it is a multiple then set it to 0*/
}
}
}
}
for(i=0;i<=9999;i++)
{
if(num[i]!=0) /*Print all prime numbers*/
{
//printf("\n%d",num[i]);
fprintf(fp, "%d\r\n", num[i]);
}
}
fclose(fp);
}
|
Advertisement
