1013.数素数

#include <iostream>
#include <vector>
#include <math.h>
using namespace std;
bool sushu(int n)
{
for (int i = 2; i <= sqrt(n); ++i)
{
if (!(n%i))
{
return 0;
}
}
return 1;
}

int _tmain(int argc, _TCHAR* argv[])
{
int num1, num2;
cin >> num1 >> num2;
int mark = 0;
vector<int> sushuji;
for (double i = 2; i < 200000;++i)                    //要一直判断到第10000个质数，库的容量要足够大
{
if (sushu(i))
{
sushuji.push_back(i);
}
}
int cnt = 0;
for (int i = num1-1; i <= num2-1;++i)                  //序号要统一
{
if (cnt == 9||i==num2-1)
{
cout << sushuji[i] << endl;
cnt = 0;
}
else
{
cout << sushuji[i] << ' ';
++cnt;
}
}
return 0;
}