当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5150:Sum Sum Sum

题目描述
We call a positive number $X$ P-number if there is not a positive number that is less than $X$ and the greatest common divisor of these two numbers is bigger than 1.
Now you are given a sequence of integers. You task is to calculate the sum of P-numbers of the sequence.
输入解释
There are several test cases.
In each test case:
The first line contains a integer $N(1\leq N\leq 1000)$. The second line contains $N$ integers. Each integer is between 1 and 1000.
输出解释
For each test case, output the sum of P-numbers of the sequence.
输入样例
3
5 6 7
1
10
输出样例
12
0
来自杭电HDUOJ的附加信息
Recommend heyang

该题目是Virtual Judge题目,来自 杭电HDUOJ

题目来源 BestCoder Round #24

源链接: HDU-5150

最后修改于 2020-10-25T23:20:13+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)