Bi-shoe and Phi-shoe LightOJ - 1370（筛素数，欧拉函数）

Bi-shoe and Phi-shoe

LightOJ - 1370

Bamboo Pole-vault is a massively popular sport in Xzhiland. And Master Phi-shoe is a very popular coach for his success. He needs some bamboos for his students, so he asked his assistant Bi-Shoe to go to the market and buy them. Plenty of Bamboos of all possible integer lengths (yes!) are available in the market. According to Xzhila tradition,

Score of a bamboo = Φ (bamboo's length)

(Xzhilans are really fond of number theory). For your information, Φ (n) = numbers less than n which are relatively prime (having no common divisor other than 1) to n. So, score of a bamboo of length 9 is 6 as 1, 2, 4, 5, 7, 8 are relatively prime to 9.

The assistant Bi-shoe has to buy one bamboo for each student. As a twist, each pole-vault student of Phi-shoe has a lucky number. Bi-shoe wants to buy bamboos such that each of them gets a bamboo with a score greater than or equal to his/her lucky number. Bi-shoe wants to minimize the total amount of money spent for buying the bamboos. One unit of bamboo costs 1 Xukha. Help him.

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with a line containing an integer n (1 ≤ n ≤ 10000) denoting the number of students of Phi-shoe. The next line contains n space separated integers denoting the lucky numbers for the students. Each lucky number will lie in the range [1, 10⁶].

Output

For each case, print the case number and the minimum possible money spent for buying the bamboos. See the samples for details.

Sample Input

3

5

1 2 3 4 5

6

10 11 12 13 14 15

2

1 1

Sample Output

Case 1: 22 Xukha

Case 2: 88 Xukha

Case 3: 4 Xukha

这道题没用让求欧拉函数但是需要知道其定义

欧拉函数定义：比他小的并与他互质的数字个数之和。

题意给你n个luky数字是欧拉函数的值。也就是个数，求竹子长度和最小，也就是欧拉函数下标和最小

因为如果p是质数，那么p的欧拉函数求值一定是p-1（除去它本身）所以比这个数大的质数就肯定是最小的，这样先把所有质数枚举出来就好办了。用到了素数筛选法。

code：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 1e6+10;
bool a[maxn];
int prime[maxn];
int p[maxn];
void init(){
    memset(a,true,sizeof(a));
    memset(prime,0,sizeof(a));
    int t = 0;
    for(int i = 2; i < maxn; i++){
        if(a[i]){
            prime[++t] = i;
            for(int j = i + i; j < maxn; j += i){
                a[j] = false;
            }
        }
    }
    t = 1;
    //p[i]记录比i大的第一个素数是几
    for(int i = 1; i < maxn; i++){
        if(prime[t] > i) p[i] = prime[t];
        else{
            t++;
            p[i] = prime[t];
        }
    }
}
int main(){
    init();
    int T;
    int cas = 0;
    scanf("%d",&T);
    while(T--){
        int n,k;
        long long ans = 0;
        scanf("%d",&n);
        for(int i = 1; i <= n; i++){
            scanf("%d",&k);
            ans += p[k];
        }
        printf("Case %d: %lld Xukha\n",++cas,ans);
    }
    return 0;
}