#include<stdio.h>
#include<conio.h>
void main()
{
int count,i=1;
int a;
clrscr();
while(i<=500)
{
count=0;
a=1;
while(a<=i)
{
if(i%a==0)
count++;
a++;
}
if(count==2)
printf("%d\t",i);
i++;
}
getch();
}

#include<stdio.h>
#include<conio.h>
 
int main(int argc, char *argv[])
{
    int count,i=1;
    int a;
    int col=0;
 
    //while(i<=500)
    for(i=1; i<501; i++)
    {
        count=0;
        a=1;
 
        while(a<=i)
        {
            if(i%a==0)
                    count++;
            a++;
        }
 
        if(count==2){
            printf("%d\t",i);
            col++;
            if(col%10==0)
                printf("\n");
        }  
        //i++;
    }
 
  system("PAUSE");	
  return 0;
}

i = 0;
while ( i < 500 ) {
  // do stuff
  i++;
}

for ( i = 0 ; i < 500 ; i++ ) {
  // do stuff
}

int flag=1;
for(int i=2;i<500;i++)      //since 1 and 500 are not prime
{                  
flag=1;
for(int j=2;j<i/2;j++)   //since a no. cannot be divisible by a 
{                                //no. greater than its half.
if(i%j==0)                 //if i is divisible by any no. between 2 & i/2
{
flag=0;
break;
}
}
if(flag==1)
printf("\n",i);
}

#include <iostream>
 
using namespace std;
 
static const int MAX = 500;
static const int MIN = 0;
static const int MAXCOL = 10;
 
bool isPrime(int r);
 
int main(int argc, char *argv[])
{
    int col = 0;
    int n;
 
    for(n=MIN; n<=MAX; n++)
      if(isPrime(n)){
          cout << n << '\t';
          col++;
          if(col == MAXCOL){
              cout << '\n';
              col = 0;
          }
      }  
 
  system("PAUSE");	
  return 0;
 
}
 
bool isPrime(int n)
{
    if((n == 0)||(n == 1))
        return false;
 
    int factors = 2;
 
    for(int i=2; i<=((int)n/2); i++){
        if(n%i == 0){
            factors++;
            break;
        }
    }
 
    if(factors == 2)
        return true;
 
   return false;
}