Light oj 1307 - Bi-shoe and Phi-shoe【欧拉函数】
来源:互联网 发布:java常用算法手册评价 编辑:程序博客网 时间:2024/06/01 08:39
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
Output for Sample Input
3
5
1 2 3 4 5
6
10 11 12 13 14 15
2
1 1
Case 1: 22 Xukha
Case 2: 88 Xukha
Case 3: 4 Xukha
#include <map>#include <set>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>#include <iostream>#include <stack>#include <cmath>#include <string>#include <vector>#include <cstdlib>//#include <bits/stdc++.h>//#define LOACL#define space " "using namespace std;typedef long long Long;//typedef __int64 Int;typedef pair<int, int> paii;const int INF = 0x3f3f3f3f;const double ESP = 1e-5;const double Pi = acos(-1.0);const int MOD = 1e9 + 5;const int MAXN = 1e6 + 5;bool nprime[MAXN];void init() {memset(nprime, false, sizeof(nprime));nprime[0] = nprime[1] = true;for (int i = 2; i < MAXN; i++) {if (!nprime[i]) {for (int j = i*2; j < MAXN; j += i) nprime[j] = true;}}}int main() {int t, a, n;int Kcase = 0;scanf("%d", &t);while (t--) {init(); Long res = 0;scanf("%d", &n);for (int i = 0; i < n; i++) {scanf("%d", &a);int cnt = a + 1;while (true) {if (!nprime[cnt]) {res += cnt; break;}cnt++;}}printf("Case %d: %lld Xukha\n", ++Kcase, res);}return 0;}
- Light OJ 1307 Bi-shoe and Phi-shoe(欧拉函数)
- Light oj 1307 - Bi-shoe and Phi-shoe【欧拉函数】
- light oj 1370-Bi-shoe and Phi-shoe (欧拉函数模板题)
- Bi-shoe and Phi-shoe(欧拉函数)
- lightoj1370 - Bi-shoe and Phi-shoe(欧拉函数)
- Bi-shoe and Phi-shoe(欧拉函数变形)
- LightOJ 1370 Bi-shoe and Phi-shoe 欧拉函数
- Bi-shoe and Phi-shoe [欧拉函数][贪心]
- Bi-shoe and Phi-shoe (欧拉函数)
- LightOJ 1370- Bi-shoe and Phi-shoe (欧拉函数)
- 【Ligth-oj】-1370 - Bi-shoe and Phi-shoe(欧拉函数+素数打表)
- Bi-shoe and Phi-shoe 线筛欧拉函数
- BNU 13288 Bi-shoe and Phi-shoe(欧拉函数)
- LightOJ 1370Bi-shoe and Phi-shoe(欧拉函数)
- LightOJ Bi-shoe and Phi-shoe 1370【欧拉函数+素数打表】
- LightOJ 1370-Bi-shoe and Phi-shoe(欧拉函数)
- LightOJ 1370 Bi-shoe and Phi-shoe (欧拉函数+二分)
- 【LightOJ】1370 - Bi-shoe and Phi-shoe(欧拉函数,素数打表)
- spring dubbo 配置环境报错
- apache-shiro详解
- C语言指针传参问题
- Java fastjson 解析json配置文件
- 天纵智能软件快速开发平台便签插件
- Light oj 1307 - Bi-shoe and Phi-shoe【欧拉函数】
- [JS]JS面向对象编程——原型继承
- 带TargetStackTraceElement的log工具类
- Java 图片切割
- Cadence : 如何去掉Orcad Capture中元件标号下划线
- uisegmentedcontrol类重写,自定义按钮和背景颜色
- haporxy 负载elasticsearch
- CSU 1806 Toll(数学+最短路)
- C# datagridview大小跟随窗口动态改变