POJ - The Euler function (欧拉筛，埃氏筛求1到n的欧拉值)

题目传送
欧拉筛 算出 (1到n) 欧拉函数值
AC代码

#include<bits/stdc++.h>
#include<iostream>
#include<stack>
#include<algorithm>
#include<queue>
#include<deque>
#include<vector>
#include<map>
#include<set>
#include<cmath>
#include<cstdio>
#include<string>
#include<cstring>
inline long long read(){char c = getchar();long long x = 0,s = 1;
while(c < '0' || c > '9') {if(c == '-') s = -1;c = getchar();}
while(c >= '0' && c <= '9') {x = x*10 + c -'0';c = getchar();}
return x*s;}
using namespace std;
#define NewNode (TreeNode *)malloc(sizeof(TreeNode))
#define Mem(a,b) memset(a,b,sizeof(a))
#define lowbit(x) (x)&(-x)
#define int long long
const int N = 3e6 + 100;
const long long INFINF = 0x7f7f7f7f7f7f7f;
const int INF = 0x3f3f3f3f;
const double EPS = 1e-5;
const int mod = 1e9+7;
const double II = acos(-1);
const double PP = (II*1.0)/(180.00);
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> piil;
ll a,b;
ll prime[N],phi[N],m;
ll sum;
bool vis[N];
void euler(ll n)
{
    phi[1] = 1;
    for(ll i = 2;i <= n;i++)
    {
        if(!vis[i])
        {
            prime[m++] = i;
            phi[i] = i-1;
        }
        for(ll j = 0;j < m && i * prime[j] <= n;j++)
        {
            vis[i*prime[j]] = 1;
            if(i % prime[j] == 0)
            {
                phi[i*prime[j]] = phi[i]*prime[j];
                break;
            }
            else phi[i*prime[j]] = phi[i]*phi[prime[j]];
        }
    }
}
signed main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    //    freopen("input.txt","r",stdin);
    //    freopen("output.txt","w",stdout);
    euler(N);
    while(cin >> a >> b)
    {
        for(ll i = a;i <= b;i++)
            sum += phi[i];
        cout << sum << endl;
        sum = 0;
    }
	return 0;
}

埃氏筛 算出 1到n的 欧拉函数值
AC代码

#include<bits/stdc++.h>
#include<iostream>
#include<stack>
#include<algorithm>
#include<queue>
#include<deque>
#include<vector>
#include<map>
#include<set>
#include<cmath>
#include<cstdio>
#include<string>
#include<cstring>
inline long long read(){char c = getchar();long long x = 0,s = 1;
while(c < '0' || c > '9') {if(c == '-') s = -1;c = getchar();}
while(c >= '0' && c <= '9') {x = x*10 + c -'0';c = getchar();}
return x*s;}
using namespace std;
#define NewNode (TreeNode *)malloc(sizeof(TreeNode))
#define Mem(a,b) memset(a,b,sizeof(a))
#define lowbit(x) (x)&(-x)
#define int long long
const int N = 3e6 + 100;
const long long INFINF = 0x7f7f7f7f7f7f7f;
const int INF = 0x3f3f3f3f;
const double EPS = 1e-5;
const int mod = 1e9+7;
const double II = acos(-1);
const double PP = (II*1.0)/(180.00);
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> piil;
ll a,b;
ll prime[N],phi[N],m;
ll sum;
bool vis[N];
void euler(ll n)
{
    for(int i = 1;i <= n;i++) phi[i] = i;
    for(int i = 2;i <= n;i++)
    {
        if(!vis[i])//质数
        {
            for(int j = i;j <= n;j += i)//这个质数的倍数，每一个都拥有这一个质数
            {
                vis[j] = 1;
                phi[j] = phi[j]/i*(i-1);
            }
        }
    }
}
signed main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    //    freopen("input.txt","r",stdin);
    //    freopen("output.txt","w",stdout);
    euler(N);
    while(cin >> a >> b)
    {
        for(ll i = a;i <= b;i++)
            sum += phi[i];
        cout << sum << endl;
        sum = 0;
    }
	return 0;
}