【CF1017F】The Neutral Zone（Bitset，埃氏筛）

题意：

思路：From https://blog.csdn.net/CSDNjiangshan/article/details/81536536

 #include<cstdio>
 #include<cstring>
 #include<string>
 #include<cmath>
 #include<iostream>
 #include<algorithm>
 #include<map>
 #include<set>
 #include<queue>
 #include<vector>
 #include<bitset>
 using namespace std;
 typedef long long ll;
 typedef unsigned int uint;
 typedef unsigned long long ull;
 typedef pair<int,int> PII;
 typedef vector<int> VI;
 #define fi first
 #define se second
 #define MP make_pair
 #define N      110000000
 #define M      51
 #define MOD 1000000007
 #define eps 1e-8
 #define pi     acos(-1)
 #define oo     3e14

 uint n,a,b,c,d;
 bitset<N> p;

 uint f(uint x)
 {
     return a*x*x*x+b*x*x+c*x+d;
 }

 uint calc(uint x)
 {
     uint k=n;
     uint ans=;
     while(k)
     {
         ans+=k/x;;
         k/=x;
     }
     ans*=f(x);
     return ans;
 }

 int main()
 {
     scanf("%u%u%u%u%u",&n,&a,&b,&c,&d);
     ull ans=calc()+calc();
     p.reset();
     for(uint i=;i<=n;i++)
     {
         if(i%==||i%==) continue;
         if(p[i/]==)
         {
             ans+=calc(i);
             for(uint j=;j<=n/i;j++)
             {
                 if(i*j%==||i*j%==) continue;
                 p[i*j/]=;
             }
         }
     }
     printf("%u",ans);
     return ;
 }