\*zyeric*/

#include #include #include #include #include #include //注意题目数据范围,能用int用int,LL有时会超时 #define LL long long using namespace std; //线性素数筛法 const long N = 200000; long prime[N] = {0},num_prime = 0;

//1-D const int maxn = 5e4 + 10; int Tree[maxn],size; inline int lowbit(int x){ return (x&-x); } void add(int x,int value){ for(int i=x;i<=size;i+=lowbit(i)) Tree[i]+=value; } int get(