输入两个数a,b 如果a,b同时为-1 跳出循环,要求:输出a,b之间的素数.
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <map>
#include <set>
typedef long long LL;
using namespace std;
int visit[90000000];
void Prime()
{
memset(visit,0,sizeof(visit));
visit[0] = visit[1] = 1;
for (LL i = 2; i <= 100005; i++)
{
if (!visit[i])
{
for (LL j = i*i; j <= 100005; j += i)
{
visit[j] = 1;
}
}
}
}
int main()
{
int n;
int a,b;
int sum=0;
Prime();
while(1)
{
cin >> a >> b;
if(a==-1&&b==-1)
break;
for(int i=a; i<=b; i++)
if(visit[i]==0)
sum++;
cout << sum << endl;
sum=0;
}
return 0;
}