#include<stdbool.h>
#include <stdio.h>
#include<math.h>
//This function is to check
//if a given number is prime
bool isPrime(int n)
{
// 0 and 1 are not prime numbers
if(n==1 || n==0)
return false;
//Check for divisibility from 2 to sqrt(n)
for(int i=2; i<=sqrt(n);i++){
if(n%i==0)
return false;
}
return true;
}
//Driver Code
int main()
{
int N= 900;
//Check every number from 1 to N
for(int i=1; i<=N; i++){
if(isPrime(i)){
printf("%d ",i);
}
}
return 0;
}
To embed this program on your website, copy the following code and paste it into your website's HTML: