#include <iostream>
#include <cstdlib>
#include <windows.h>

using namespace std;
void c_primes(long param);

void c_primes(long param)
{
     float t_before, t_after;
     long int arr_primes[param],i,j;
     for (i=2;i<=param;i++)
     {
         arr_primes[i]=i;
     }
     t_before=GetTickCount();
         for (i=2;i<=param;i++)
         {
             if (arr_primes[i] == 0) { continue; }
                for (j=(i+1);j<=param;j++)
                {
                    if (arr_primes[j] != 0 && arr_primes[j]%i==0)
                    {
                        arr_primes[j]=0;
                    }
                }
         }
     t_after=GetTickCount();
     cout<<"\n\nCalculation time: "<<t_after-t_before<<" milliseconds\n\n";
     cout<<"Press a key to display the prime numbers\n";
     system("PAUSE");
     cout<<"\nPrimes from 0 to "<<param<<":\n";
     for (long x=2;x<param+1;x++)
     {
         if (arr_primes[x] != 0) { cout<<arr_primes[x]<<", "; }
     }
     cout<<"\n";
     delete [] arr_primes;
}

int main(int argc, char *argv[])
{
    long m_primes;

    cout<<"\n   Welcome\n\Calculate prime numbers from 0 to: ";
    cin>>m_primes;
    c_primes(m_primes);     //c_primes stands for calculate primes
    system("PAUSE");
    return EXIT_SUCCESS;
}

#include <stdio.h>

int main(void)
{
	int x=1,y;
	while(x++)
	{
		for(y=2;x%y;)
			printf(++y/x+"\0%d\n", x);
	}
	return 0;
}

printf(++y/x+"\0%d\n", x);

#include <stdio.h>
#include <math.h>

#define true 1
#define false 0

int is_prime (double num)
{
	long i;
	
	if (num < 2)
	{
		return false;
	}
	else if (num == 2)
	{
		return true;
	}
	else
	{
		for (i = 3; i <= sqrt(num); i += 2)
		{
			if ((num / i) == ceil(num / i))
			{
				return false;
			}
		}
		
		return true;
	}
}

int main ()
{
	double i;
	
	for (i = 1; i > 0; i++)
	{
		if (is_prime(i))
		{
			printf("%.0f\n", i);
		}
	}
	
	getchar();
	return 0;
}