该楼层疑似违规已被系统折叠 隐藏此楼查看此楼
#include
#include
int isPrimeNumber (long numberToCheck)
{
long i=0;
if(numberToCheck==1)
{
return 0;
}
if(numberToCheck==2)
{
return 1;
}
for(i=2;i<=numberToCheck/2;i++)
{
if(numberToCheck%i==0)
{
return 0;
}
}
return 1;
}
void listPrimeNumber (long maximum)
{
printf("2 ");
int i=0,Thenumberofall=0,a=0,b=0,c=0;
for(i=1;i<=maximum;i+=2)
{if(isPrimeNumber(i)==1&&i<1000)
{printf("%d ",i);a++;b++;c++;}
else if(isPrimeNumber(i)==1&&i<100000)
{printf("%d ",i);b++,c++;}
else if(isPrimeNumber(i)==1&&i<1000000)
{
printf("%d ",i);c++;
}
}
printf("\nThere was %d prime number before 1000",a+1);
printf("\nThere was %d prime number before 100000",b+1);
printf("\nThere was %d prime number before 1000000",c+1);}
int main()
{
long numberTheUserChoose=0;
printf("Choose a number please : ");
scanf("%ld",&numberTheUserChoose);
listPrimeNumber(numberTheUserChoose);
return 0;
return 0;
}