【Light oj 1370】Bi-shoe and Phi-shoe（欧拉函数）

Description

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, 106].

Output

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

题解：

每个小朋友都有幸运值，需要给每个小朋友一个数，满足 φ(n)的个数大于等于小朋友的幸运值。
很明显我们要用到欧拉函数，先打表，求出n个数的欧拉函数，然后每输入一个数就加上满足条件的欧拉函数对应的n。
不懂欧拉函数的点这里2333

代码：

*#include<iostream>
#include<stdio.h>
#include<cstring>
using namespace std;
const int Max=1020000;
int phi[Max],a;
void euler()
{
    memset(phi,0,sizeof(phi));
    phi[1]=1;
    for(int i=2;i<Max;i++)
    {
        if(!phi[i])
        {
            for(int j=i;j<Max;j+=i)
            {
                if(!phi[j])
                    phi[j]=j;
            phi[j]=phi[j]/i*(i-1);
            }
        }
    }
}
int main()
{
    int t,n;
    scanf("%d",&t);
    euler();
    for(int k=1;k<=t;k++)
    {
        long long sum=0;
        scanf("%d",&n);
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a);
             int j=a+1;
            while(a>phi[j])
                j++;
            sum+=j;
        }
        printf("Case %d: %lld Xukha\n",k,sum);
    }
    return 0;
}