print all prime number which less than N using c++

prime.cpp

#include<iostream>
#include<cmath>
#define N 200000
using namespace std;
bool prime[N];
int main()
{
    int i, j;
    prime[0] = prime[1] = false;
    prime[2] = true;

    for(i=3; i<N; i++)
    {
         if(i%2)
             prime[i]=true;
         else
             prime[i] = false;
    }

    for(i=3; i<=sqrt(N*1.0); i=i+2)
    {
         if(prime[i])
         {
             for(j=i+i; j<N; j+=i)
                prime[j]=false;
         }
    }

    for(i=2; i<N; i++)
    {
         if( prime[i] )
             cout << i << endl;
    }


    return 0;
}