LightOJ

题目链接：http://lightoj.com/login_main.php?url=volume_showproblem.php?problem=1370

题目大意：给N个数a[i]， N <= 1e6，问使 Φ(x) >= a[i] 成立的最小x的所有x的和是多少。

解题思路：我们知道的是对于素数 m 来说，phi[m] = m - 1。另一方面，对于一个合数 m 来说， phi[m] < phi[x] ， x > m && x 是素数。

因此，我们可以认为，每个非素数 m, 对应的 x 值是大于x的最小素数减一。

代码：

const int maxn = 2e6 + 100;
vector<int> primes;
int n, a[maxn];
bool vis[maxn];
int lphi[maxn];

void dowork(){
    memset(vis, 0, sizeof(vis));
    int mxn = 2e6 + 5;
    for(int i = 2; i <= mxn; i++)
        for(int j = i * 2; j <= mxn; j += i)
            vis[j] = 1;
    for(int i = 2; i <= mxn; i++)
        if(!vis[i]) primes.push_back(i);
    for(int i = 0; i < primes.size(); i++) lphi[primes[i] - 1] = primes[i];
    int i = 1, j = 0;
    while(i < 2e6 + 5){
        int x = primes[j] - 1;
        if(i <= x) lphi[i] = lphi[x];
        else {
            x = primes[++j] - 1;
            lphi[i] = lphi[x];
        }
        i++;
    }
} 
ll solve(){
    ll ans = 0;
    for(int i = 1; i <= n; i++){
        ans += lphi[a[i]];
    }
    return ans;
}
int main(){
    dowork();
    int T;
    scanf("%d", &T);
    for(int t = 1; t <= T; t++){
        scanf("%d", &n);
        for(int i = 1; i <= n; i++) scanf("%d", a + i);
        ll ans = solve();
        printf("Case %d: %lld Xukha
", t, ans);
    }
}

题目：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

LightOJ - 1370