A - Bi-shoe and Phi-shoe

Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu

Appoint description: 
System Crawler  (2016-07-08)

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

题意:

Φ (n)表示长度为小于数字n的和n互质的数的个数,也就是欧拉函数。现在给出n个幸运数字,对于每一个幸运数字,要求的x,使Φ (n)的值大于等于这个幸运数字,求这些x和的最小值。

思路:

先打表,对输入的n个数排序,然后枚举。

/*
* Author: sweat123
* Created Time: 2016/7/11 13:55:52
* File Name: main.cpp
*/
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<string>
#include<vector>
#include<cstdio>
#include<time.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#define INF 1<<30
#define MOD 1000000007
#define ll long long
#define lson l,m,rt<<1
#define key_value ch[ch[root][1]][0]
#define rson m+1,r,rt<<1|1
#define pi acos(-1.0)
using namespace std;
const int MAXN = ;
int er[MAXN],notprime[MAXN],cnt,n;
int prime[MAXN];
struct node{
int id,val;
friend bool operator <(node fa,node fb){
if(fa.val != fb.val)return fa.val > fb.val;
return fa.id > fb.id;
}
};
int num;
void init(){
cnt = ;
memset(er,,sizeof(er));
memset(notprime,,sizeof(notprime));
for(int i = ; i <= MAXN - ; i++){
if(!notprime[i]){
er[i] = i - ;
prime[cnt++] = i;
}
for(int j = ; j < cnt && 1LL * prime[j] * i <= MAXN; j++){
notprime[i * prime[j]] = ;
if(i % prime[j] == ){
er[i * prime[j]] = er[i] * prime[j];break;
} else {
er[i * prime[j]] = er[i] * (prime[j] - );
}
}
}
}
int a[];
int main(){
init();
int t,Case = ;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(int i = ; i <= n; i++){
scanf("%d",&a[i]);
}
sort(a+,a+n+);
ll ans = ;
int x = ;
for(int i = ; i <= n; i++){
while(er[x] < a[i]){
x += ;
}
ans += x;
}
printf("Case %d: %lld Xukha\n",++Case,ans);
}
return ;
}

最新文章

  1. JavaScript-Object基础知识
  2. C# BackgroundWorker组件学习入门介绍
  3. NOIP2010提高组乌龟棋 -SilverN
  4. 手机抓包xcode自带命令行工具配合wireshark实现
  5. C#程序中注释过多的8条理由
  6. 正确理解SQL Server的许可证(转)
  7. ASCII Table/ASCII表
  8. c#转码解码
  9. linux学习历程
  10. display:flex css
  11. TensorFlow与主流深度学习框架对比
  12. Cisco动态路由配置
  13. Web前端框架与移动应用开发第七章:二
  14. APScheduler(Python化的Cron)使用总结 定时任务
  15. Spring导出可以运行的jar包
  16. topcoder srm 460 div1
  17. Vue音乐项目笔记(四)(搜索页面提取重写)
  18. eval 日期对象
  19. 解决Windows Server2008 R2中IE开网页时弹出阻止框
  20. bzoj3920: Yuuna的礼物(莫队+分块套分块)

热门文章

  1. Java虚拟机详解----JVM常见问题总结
  2. Unity(64bit)5.1 打开无故出现框框,纹理不见了
  3. Google Guava官方教程(中文版)
  4. html5游戏-包围盒检测算法
  5. CentOS 6.6 安装redmine
  6. 树莓派及其他硬件平台国内外Linux镜像站全汇总
  7. 在PHP中无法连接Memcached的解决办法
  8. FSL - DualRegression
  9. node基础05:路由基础
  10. Hadoop: MapReduce2的几个基本示例