prime number in given range

#include <bits/stdc++.h>
using namespace std;
vector<long int>v;
vector<int>s(1000001);
void prime()
{
        int i,j,cnt=0;
        for(i=0;i<=1000000;i++)
        {
            if(i%2==1)s[i]=1;
            else s[i]=0;
        }
        s[1]=0;
        s[2]=1;
        v.push_back(2);
        for(i=3;i<=1000000;i+=2)
        {
            if(s[i]==1)
            {
                v.push_back(i);
                for(int j=2;j<=(1000001/i);j++)
                s[i*j]=0;
            }
        }
}
int main() {
    int i,j,t,x;
    long int n;
    prime();

        for(i=0;i<v.size();i++)
        {
            cout<<v[i]<<" ";
        }

    return 0;
}