###### NOBODY????
by Neils_Lin @ 2018-08-04 19:26:13
好吧...是数组的问题
by Neils_Lin @ 2018-08-05 11:47:52
能发给我6测试点吗？？
by Snowflake_Pink @ 2018-08-19 22:10:29
@[Neils_Lin](/space/show?uid=52065) 我欧拉筛+记忆化，第6点t掉了
by Snowflake_Pink @ 2018-08-19 22:11:25
嘿嘿嘿，我氧气潜过去了
by Snowflake_Pink @ 2018-08-19 22:24:17
```cpp
#include <bits/stdc++.h>
using namespace std;
short int book1[50000001]={2,2,1,1};
short int book2[50000001];
inline int in()
{
int X=0,w=0; char ch=0;
while(!isdigit(ch)) {w|=ch=='-';ch=getchar();}
while(isdigit(ch)) X=(X<<3)+(X<<1)+(ch^48),ch=getchar();
return w?-X:X;
}
inline void out(int x)
{
if(x<0) putchar('-'),x=-x;
if(x>9) out(x/10);
putchar(x%10+'0');
}
inline int isprime(int n){
if (n>=50000000?book2[n-50000000]:book1[n]==1) return 1;
if (n>=50000000?book2[n-50000000]:book1[n]==2) return 0;
float n_sqrt;
//if (n==1) return 0;
//if(n==2||n==3) return 1;
if(n%6!=1 && n%6!=5){
n>=50000000?book2[n-50000000]:book1[n]=2;
return 0;
}
n_sqrt=floor(sqrt((float)n));
for(int i=5;i<=n_sqrt;i+=6)
if(n%(i)==0 || n%(i+2)==0){
n>=50000000?book2[n-50000000]:book1[n]=2;
return 0;
}
n>=50000000?book2[n-50000000]:book1[n]=1;
return 1;
}
int main(){
int n,i,j;
long long flag;
n=in();
flag=in();
for (i=1;i<=n;i++){
long long ans=0,l,r;
l=in();
r=in();
if (r>flag||l<=0){
cout <<"Crossing the line"<<endl;
continue;
}
for (j=l;j<=r;j++)
if (isprime(j)) ans++;
out(ans);
cout <<endl;
}
return 0;
}
```
by Snowflake_Pink @ 2018-08-19 22:25:02