ACM-ICPC 2018 南京赛区网络预赛 J.sum（线性筛）*

题目链接：https://nanti.jisuanke.com/t/A1956

题面：

A square-free integer is an integer which is indivisible by any square number except 11. For example, 6 = 2 \cdot 3,6=2⋅3 is square-free, but 12 = 2^2 \cdot 312=2

⋅3 is not, because 2^22
2
is a square number. Some integers could be decomposed into product of two square-free integers, there may be more than one decomposition ways. For example, 6 = 1\cdot 6=6 \cdot 1=2\cdot 3=3\cdot 2, n=ab6=1⋅6=6⋅1=2⋅3=3⋅2,n=ab and n=ban=ba are considered different if a \not = ba

​
=b. f(n)f(n) is the number of decomposition ways that n=abn=ab such that aa and bb are square-free integers. The problem is calculating ${\sum }_{i=1}^{n}f(i).$

Input
The first line contains an integer T(T\le 20)T(T≤20), denoting the number of test cases.

For each test case, there first line has a integer n(n \le 2\cdot 10^7)n(n≤2⋅10
7
).

Output
For each test case, print the answer \sum_{i = 1}^n f(i)∑
i=1
n
​
f(i).

Hint
$$\begin{gathered} {\sum }_{i=1}^{8}f(i)=f(1)+\cdots +f(8) \\ =1+2+2+1+2+4+2+0=14. \end{gathered}$$

样例输入 复制
2
5
8
样例输出 复制
8
14
题目来源
ACM-ICPC 2018 南京赛区网络预赛

---

非线性筛做法_{（这个做法应该不是线性筛）}：

先预处理，将不含平方因子的数放在f数组中，f[1…i]表示前i个不含平方因子的数
同时预处理sum[i]，sum[i]表示正整数i前面不含平方因子的个数（包括i本身）
令$S(n)$为题目所求，那么S(n)就等于所有的a*b(a,b不含平方因子且a*b<=n）的情况数。
以n=20举例，所有的情况如下：