Bi-shoe and Phi-shoe 欧拉函数

最新推荐文章于 2021-11-24 18:46:37 发布

运行什么，直接交

最新推荐文章于 2021-11-24 18:46:37 发布

阅读量131

点赞数

本文链接：https://blog.csdn.net/weixin_43916298/article/details/103408645

版权

说是欧拉函数，其实就是判断个素数就完事了，因为求小于n的与n互质个数>=x的n的最小值；打表可以发现这个n就是大于x的最小质数；

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

1 2 3 4 5

10 11 12 13 14 15

1 1

Sample Output
Case 1: 22 Xukha

Case 2: 88 Xukha

Case 3: 4 Xukha

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.

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

1 2 3 4 5

10 11 12 13 14 15

1 1

Sample Output

Case 1: 22 Xukha

Case 2: 88 Xukha

Case 3: 4 Xukha

Score of a bamboo = Φ (bamboo's length)

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

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

1 2 3 4 5

10 11 12 13 14 15

1 1

Sample Output

Case 1: 22 Xukha

Case 2: 88 Xukha

Case 3: 4 Xukha

Score of a bamboo = Φ (bamboo's length)

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

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

1 2 3 4 5

10 11 12 13 14 15

1 1

Sample Output

Case 1: 22 Xukha

Case 2: 88 Xukha

Case 3: 4 Xukha

Score of a bamboo = Φ (bamboo's length)

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

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

1 2 3 4 5

10 11 12 13 14 15

1 1

Sample Output

Case 1: 22 Xukha

Case 2: 88 Xukha

Case 3: 4 Xukha

Score of a bamboo = Φ (bamboo's length)

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

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

1 2 3 4 5

10 11 12 13 14 15

1 1

Sample Output

Case 1: 22 Xukha

Case 2: 88 Xukha

Case 3: 4 Xukha

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxx=1e6+8;
ll oula[maxx];
int sushu[maxx],biaoji[maxx];
int cnt=0;
int ans[maxx];
void oulashai()
{
	for(int i=2;i<maxx;i++)
	{
		if(!biaoji[i])
		{
			sushu[++cnt]=i;
			oula[i]=i-1;
		}
		for(int j=1;j<=cnt&&i*sushu[j]<maxx;j++)
		{
			biaoji[i*sushu[j]]=1;
			oula[i*sushu[j]]=oula[sushu[j]]*oula[i];
			if(i%sushu[j]==0)
			{
				oula[i*sushu[j]]=sushu[j]*oula[i];
				break;
			}
		}
	}
}
int main()
{
	oulashai();
	int j=1;
	for(int i=1;i<maxx;i++)
	{
		if(i>=sushu[j]) j++;
		ans[i]=sushu[j];
	}
	int t,n;
	cin>>t;
	int cas=0;
	while(t--)
	{
		cin>>n;
		ll res=0;
		for(int i=1;i<=n;i++) 
		{
			int x;
			cin>>x;
			res+=ans[x];
		}
		printf("Case %d: %lld Xukha\n",++cas,res);
	}
	return 0;
}

简洁埃式筛版：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxx=1e6+8;
int sushu[maxx],biaoji[maxx];
int cnt=0;
int ans[maxx];
void aishishai()
{
	for(int i=2;i<maxx;i++)
	{
		if(!biaoji[i])
		{
			sushu[++cnt]=i;
		}
		for(int j=i*2;j<maxx;j+=i)
		biaoji[j]=1;
	}
}
int main()
{
	aishishai();
	int j=1;
	for(int i=1;i<maxx;i++)
	{
		if(i>=sushu[j]) j++;
		ans[i]=sushu[j];
	}
	int t,n;
	cin>>t;
	int cas=0;
	while(t--)
	{
		cin>>n;
		ll res=0;
		for(int i=1;i<=n;i++) 
		{
			int x;
			cin>>x;
			res+=ans[x];
		}
		printf("Case %d: %lld Xukha\n",++cas,res);
	}
	return 0;
}

运行什么，直接交

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
Bi-shoe and Phi-shoe 欧拉函数

说是欧拉函数，其实就是判断个素数就完事了，因为求小于n的与n互质个数>=x的n的最小值；打表可以发现这个n就是大于x的最小质数；Bamboo Pole-vault is a massively popular sport in Xzhiland. And Master Phi-shoe is a very popular coach for his success. He n...
复制链接

扫一扫