Hey i was trying SPOJ prime-generator problem and i have written my code for it and it gives correct output but SPOJ still showing that answer is wrong.
My code is below please tell why my code is wrong
#include <bits/stdc++.h>
using namespace std;
int t,i,j;
long long m,n;
int primegenerator(long long x);
int main()
{
cin >> t;
for(i=0;i<t;i++)
{
cin >> m >> n;
for(j=m;j<=n;j++)
{
primegenerator(j);
}
}
return 0;
}
int primegenerator(long long x)
{
int k;
for(k=2;k<=sqrt(x);k++)
{
if(x%k==0)
return 0;
}
cout << x << endl;
}