#include<stdio.h>
int isPreme(int x,int a[], int b);
int main(void)
{
const int number=100;
int prime[number]={2};
int count=1;
int i=3;
while (count<number){
if(isPreme(i,prime,count)){
prime[count++]=i;
}
i++;
}
for(i=0;i<number;i++){
printf("%d",prime[i]);
if((i+1)%5)printf("\t");
else printf("\n");
}
return 0;
}
int isPreme(int x,int knownPrimes[], int numberOfKnownPrimes)
{
int ret=1;
int i;
for(i=0;i<numberOfKnownPrimes;i++){
if(i%knownPrimes[i]==0){
ret=0;
break;
}
}
return ret;
}