开发者社区> angel_imp> 正文
阿里云
为了无法计算的价值
打开APP
阿里云APP内打开

LightOJ 1370 Bi-shoe and Phi-shoe(素数筛)

简介:
+关注继续查看

Click Here~~
A - Bi-shoe and Phi-shoe
Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu

Submit

Status

Practice

LightOJ 1370

Description

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

题目大意:
首先给出T组数据,给一些数ai(第 i 个数),ai这些数代表的是某个数欧拉函数的值,我们要求出数 pi 的欧拉函数值不小于ai。而我们要求的就是这些 pi 这些数字的和sum,而且我们想要sum最小,求出sum至少是多少。

解题思路:
要想找到最小的和 只要我们考虑的是每个pi最小 因为素数的欧拉函数值是素数-1,所以我们只需要找到比ai大的第一个素数就行啦,然后我们就想到素数筛啦 哈哈~~ 其实数据范围是1e6,并不是很大 所以可以直接存下
详见代码:

#include <iostream>
#include <cstring>
using namespace std;
typedef long long LL;
const int MAXN = 1e6+5;
int prime[MAXN];///存素数的
int cnt;///素数的个数
bool p[MAXN];///判断素数滴
void isprime()///素数筛
{
    cnt = 0;
    memset(p, true, sizeof(p));
    p[1] = false;
    for(LL i=2; i<MAXN; i++)
    {
        if(p[i])
        {
            prime[cnt++] = i;
            for(LL j=i*i; j<MAXN; j+=i)
                p[j] = false;
        }
    }
}
///没有用的欧拉函数 白写了~~
///int Eular(int m)
///{
///    int ret = m;
///    for(int i=2; i<m; i++)
///    {
///        if(m%i == 0)
///        {
///            ret -= ret/i;
///            while(m%i)
///                m /= i;
///        }
///    }
///    if(m > 1)
///        ret -= ret/m;
///    return ret;
///}
int main()
{
    isprime();
    ///cout<<prime[cnt-1]<<endl;
    LL T, m, num;
    cin>>T;
    for(int cas=1; cas<=T; cas++)
    {
        cin>>m;
        LL sum = 0;
        while(m--)
        {
            cin>>num;
            for(int i=num+1; ; i++)///找到第一个素数
            {
                if(p[i])
                {
                    sum += i;
                    break;
                }
            }
        }
        cout<<"Case "<<cas<<": "<<sum<<" Xukha\n";
    }
    return 0;
}

版权声明:本文内容由阿里云实名注册用户自发贡献,版权归原作者所有,阿里云开发者社区不拥有其著作权,亦不承担相应法律责任。具体规则请查看《阿里云开发者社区用户服务协议》和《阿里云开发者社区知识产权保护指引》。如果您发现本社区中有涉嫌抄袭的内容,填写侵权投诉表单进行举报,一经查实,本社区将立刻删除涉嫌侵权内容。

相关文章
ICPC North Central NA Contest 2018 C . Rational Ratio(结论 模拟 gcd)
ICPC North Central NA Contest 2018 C . Rational Ratio(结论 模拟 gcd)
0 0
[UVA1364 | POJ | NC]Knights of the Round Table | Tarjan 求点双 | 二分图 | 综合图论
我们可以很轻松地发现,被提出的都是在点双连通分量之外的,比如该图中的1 和 5 ,那么怎么判断哪些点不在环中呢? 此时我们还可以逆向思考,不 在 环 中 的 = = 总 的 − 在 环 中 的,所以说现在问题就转换成了满足条件的环内的点的个数
0 0
[Nowcoder] network | Tarjan 边双连通分量 | 缩点 | LCA倍增优化 | 并查集
题目描述 A network administrator manages a large network. The network consists of N computers and M links between pairs of computers. Any pair of computers are connected directly or indirectly by successive links, so data can be transformed between any two computers.
0 0
【欧拉计划第 11 题】 网格中的最大乘积 Largest product in a grid
【欧拉计划第 11 题】 网格中的最大乘积 Largest product in a grid
0 0
ACM模板——欧拉函数(PHI)
ACM模板——欧拉函数(PHI)
0 0
51Nod 1083 矩阵取数问题(矩阵取数dp,基础题)
1083 矩阵取数问题 基准时间限制:1 秒 空间限制:131072 KB 分值: 5 难度:1级算法题 一个N*N矩阵中有不同的正整数,经过这个格子,就能获得相应价值的奖励,从左上走到右下,只能向下向右走,求能够获得的最大价值。
690 0
+关注
文章
问答
文章排行榜
最热
最新
相关电子书
更多
低代码开发师(初级)实战教程
立即下载
阿里巴巴DevOps 最佳实践手册
立即下载
冬季实战营第三期:MySQL数据库进阶实战
立即下载