题目链接:https://vjudge.net/problem/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, 106].
Output
For each case, print the case number and the minimum possible money spent for buying the bamboos. See the samples for details.
题面翻译:
一个长度为x的竹子,其分数值为Φ (x) ,即欧拉函数值;其价钱为x,即买一个长度为x的竹子需要花费x Xukha(一种货币)
先给出n个同学的lucky number,要求给他们的竹子分数值要大于他们各自的lucky number
同时,要求所花的钱要尽量的小
分析:
显而易见的欧拉函数值打表题,相关知识可见:欧拉函数计算及打表
但是有两个注意点:
①这道题φ(1)=0 ,与常规的定义不同
②每一种长度的竹子是可以买无数次的
代码详解:
①欧拉函数打表
1000003为质数,所以φ(1000003)=1000002必定满足题目条件,故数组开到1000010
开大了会内存超限
int phi[1000010];
void Euler_excel(int n){
phi[1]=0;
for(int i=2;i<=n;i++) phi[i]=0;
for(int i=2;i<=n;i++)
if(!phi[i]){
for(int j=i;j<=n;j+=i){
if(!phi[j]) phi[j]=j;
phi[j]=phi[j]/i*(i-1);
}
}
}
②贪心查找
将读入的n个数进行排序,从最小的数开始,寻找第一个φ(x)大于该数的x,并记录pos,下一次直接从pos开始寻找即可
int num[n+1];
for(int i=1;i<=n;i++)
scanf("%d",&num[i]);
sort(num+1,num+n+1);
int pos=1;
long long ans=0;
for(int i=1;i<=n;i++){
for(int j=pos;;j++){
if(phi[j]>=num[i]){
ans+=(long long )j;
pos=j;
break;
}
}
}
完整AC代码:
#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
int phi[1000010];
void Euler_excel(int n){
phi[1]=0;
for(int i=2;i<=n;i++) phi[i]=0;
for(int i=2;i<=n;i++)
if(!phi[i]){
for(int j=i;j<=n;j+=i){
if(!phi[j]) phi[j]=j;
phi[j]=phi[j]/i*(i-1);
}
}
}
int main(){
Euler_excel(1000007);
int T;
scanf("%d",&T);
for(int Case=1;Case<=T;Case++){
int n;
scanf("%d",&n);
int num[n+1];
for(int i=1;i<=n;i++)
scanf("%d",&num[i]);
sort(num+1,num+n+1);
int pos=1;
long long ans=0;
for(int i=1;i<=n;i++){
for(int j=pos;;j++){
if(phi[j]>=num[i]){
ans+=(long long )j;
pos=j;
break;
}
}
}
printf("Case %d: %lld Xukha\n",Case,ans);
}
return 0;
}