Bi-shoe and Phi-shoe [欧拉函数][贪心]

最新推荐文章于 2021-07-31 11:00:09 发布

ctsas

最新推荐文章于 2021-07-31 11:00:09 发布

阅读量432

点赞数

分类专栏：欧拉函数贪心算法文章标签：欧拉函数

本文链接：https://blog.csdn.net/ctsas/article/details/55210523

版权

欧拉函数同时被 2 个专栏收录

8 篇文章 0 订阅

订阅专栏

贪心算法

6 篇文章 0 订阅

订阅专栏

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.

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

解题报告

注意答案范围超int，使用o(n)筛Euler函数值表，然后贪心记录最优解

#include<stdio.h>
#include<algorithm>
#define MAX_N 1100000
#define INF 0x3f3f3f3f
using namespace std;
int best[MAX_N];

int e[MAX_N];
void Euler(){
    for(int i=0;i<MAX_N;i++) e[i]=i;
    for(int i=2;i<MAX_N;i++)
        if(e[i]==i)
            for(int k=i;k<MAX_N;k+=i) e[k]=e[k]/i*(i-1);
}

int find(int x){
    return best[x]?best[x]:best[x]=find(x+1);
}

int main()
{
    Euler();
    int now=0;
    for(int i=2;i<MAX_N;i++)
        if(e[i]>now&&!best[e[i]]) best[e[i]]=i,now=e[i];

    int T,n;
    scanf("%d",&T);
    for(int t=1;t<=T;t++){
        scanf("%d",&n);
        long long ans=0;
        while(n--){
            int get;
            scanf("%d",&get);
            ans+=find(get);
        }
        printf("Case %d: %lld Xukha\n",t,ans);
    }
    return 0;
}