数论基础

1 .light oj 1370 https://vjudge.net/problem/LightOJ-1370
题意：给出一段数列，对数列中每个数找到一个最小的欧拉函数值大于等于他的数，求这些满足条件数的和。
题解：预处理欧拉函数值，再对原数列排序，再扫一遍即可。
代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define LL long long
using namespace std;

const int maxn = 1000005;

int T, n, a[maxn];
int phi[maxn];
LL ans;

void pre(){
    for(int i = 2; i <= maxn; i++) phi[i] = i;
    for(int i = 2; i <= maxn; i++){
        if(phi[i] == i){
            for(int j = i; j <= maxn; j += i){
                phi[j] = phi[j]/i*(i-1);
            }
        }
    }
}


int main(){
    int kase = 0;
    pre();
    scanf("%d", &T);
    while(T--){
        int m = 0;
        ans = 0;
        scanf("%d", &n);
        for(int i = 1; i <= n; i++){
            scanf("%d", &a[i]);
        }
        sort(a+1, a+n+1);
        int x = 2;
        for(int i = 1; i <= n; i++){
            while(phi[x] < a[i])
                x++;
            ans += x;
        }
        printf("Case %d: %lld Xukha\n", ++kase, ans);
    }
return 0;
}