Spoj-PRIME GENERATOR (Using segmented sieve print billion range primes)

https://www.spoj.com/problems/PRIME1/
https://www.geeksforgeeks.org/segmented-sieve-print-primes-in-a-range/

#include <bits/stdc++.h>
using namespace std;

// This functions finds all primes smaller than limit
// using simple sieve of eratosthenes.  It stores found
// primes in vector prime[]
void simpleSieve(int limit, vector<int>& prime)
{
    bool mark[limit + 1];
    memset(mark, false, sizeof(mark));

    for (int i = 2; i <= limit; ++i) {
        if (mark[i] == false) {
            // If not marked yet, then its a prime
            prime.push_back(i);
            for (int j = i; j <= limit; j += i)
                mark[j] = true;
        }
    }
}

// Finds all prime numbers in given range using
// segmented sieve
void primesInRange(int low, int high)
{
    // Comput all primes smaller or equal to
    // square root of high using simple sieve
    int limit = floor(sqrt(high)) + 1;
    vector<int> prime;
    simpleSieve(limit, prime);

    // Count of elements in given range
    int n = high - low + 1;

    // Declaring boolean only for [low, high]
    bool mark[n + 1];
    memset(mark, false, sizeof(mark));

    // Use the found primes by simpleSieve() to find
    // primes in given range
    for (int i = 0; i < prime.size(); i++) {
        // Find the minimum number in [low..high] that is
        // a multiple of prime[i] (divisible by prime[i])
        int loLim = floor(low / prime[i]) * prime[i];
        if (loLim < low)
            loLim += prime[i];
        if(loLim==prime[i])
            loLim += prime[i];
        /*  Mark multiples of prime[i] in [low..high]:
            We are marking j - low for j, i.e. each number
            in range [low, high] is mapped to [0, high - low]
            so if range is [50, 100]  marking 50 corresponds
            to marking 0, marking 51 corresponds to 1 and
            so on. In this way we need to allocate space only
            for range  */
        for (int j = loLim; j <= high; j += prime[i])
            mark[j - low] = true;
    }

    // Numbers which are not marked in range, are prime
    for (int i = low; i <= high; i++)
        if (!mark[i - low])
            cout << i <<endl;
}

// Driver program to test above function
int main()
{
    long long low,high,a;
    cin>>a;
    for(int i=0; i<a; i++)
    {
        cin>>low>>high;
        cout<<endl;
        if(low==1)
        {
            low=low+1;
        }
        primesInRange(low, high);
    }
    return 0;
}