Bi-shoe and Phi-shoe（欧拉函数）

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)为1~n中与n互质的数的个数。
每个学生都有幸运数字，他们都能得到一个分数大于或等于他的幸运数字的竹子（购买竹子的总花费降到最低。一单位竹子价值1 Xukha。）
用例数量T (≤ 100)，学生个数n(1 ≤ n ≤ 10000)，每个学生有一个幸运数字(1 ≤ lucky number ≤ 10⁶)

解题思路

用欧拉函数打表，发现规律：最小的大于幸运数字的竹子长度n为大于幸运数字的第一个素数。

ac代码

#include <math.h>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
using namespace std;

const int N = 1e6 + 5;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;

typedef long long ll;
typedef pair<int, int> PII;

int n;
int a[N];
bool st[N];
int primes[N], phi[N], ans[N];

void get_eulers(int n){
    phi[1] = 0;
    int cnt = 0;
    st[1] = true;
    for(int i = 2; i <= n; i++){
        if(!st[i]){
            primes[cnt++] = i;
            phi[i] = i - 1;
        }
        for(int j = 0; primes[j] <= n / i; j++){
            st[primes[j] * i] = true;
            if(i % primes[j] == 0){
                phi[primes[j] * i] = primes[j] * phi[i];
                break;
            }
            phi[primes[j] * i] = (primes[j] - 1) * phi[i];
        }
    }
    for(int i = 1; i <= n;){
        for(int j = i + 1; ; j++){
            if(!st[j]){
                for(int k = i; k <= j; k++){
                    ans[k] = j;
                }
                i = j;
                break;
            }
        }
    }
}

int main() {
    int t;
    scanf("%d", &t);

    get_eulers(N);

    for(int k = 1; k <= t; k++){
        scanf("%d", &n);

        ll sum = 0;

        for(int i = 0; i < n; i++){
            scanf("%d", &a[i]);
            sum += ans[a[i]];
        }

        printf("Case %d: %lld Xukha\n", k, sum);
    }

    return 0;
}