题目链接:https://nanti.jisuanke.com/t/30999
A square-free integer is an integer which is indivisible by any square number except 11. For example, 6=2⋅36=2⋅3 is square-free, but 12=22⋅312=22⋅3 is not, because 2222 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⋅6=6⋅1=2⋅3=3⋅2,n=ab6=1⋅6=6⋅1=2⋅3=3⋅2,n=ab and n=ban=ba are considered different if a̸=ba̸=b. f(n)f(n) is the number of decomposition ways that n=abn=absuch that aa and bb are square-free integers. The problem is calculating ∑i=1nf(i)∑i=1nf(i).
Input
The first line contains an integer T(T≤20)T(T≤20), denoting the number of test cases.
For each test case, there first line has a integer n(n≤2⋅107)n(n≤2⋅107).