找出x到y间的所有素数

#include
#include<stdlib.h>
using namespace std;
int isprime(int x, int y)
{
int a[10000];
for (int z = 0; x<= y; x++)
{
if( (x % 2 != 0 && x % 3 != 0)||(x2||x3))
{
z++;
a[z] = x;
cout <<" "<< a[z];
}
}
return 1;
}
int main()
{
int x, y;
cout << “Input digt:” << endl;
cout << “min”;
cin >> x;
cout << “max”;
cin >> y;
isprime(x, y);
system(“pause”);
return 0;
}