DIVCNT2 - Counting Divisors (square)

$\sigma_0(i)$ 表示$i$ 的约数个数 求$S_2(n)=\sum_{i=1}^n\sigma_0(i^2)$ 多测。 答案对$2^{64}$取模。 数据范围：  Translated by @Kelin

Let $ \sigma_0(n) $ be the number of positive divisors of $ n $ . For example, $ \sigma_0(1) = 1 $ , $ \sigma_0(2) = 2 $ and $ \sigma_0(6) = 4 $ . Let $$ S_2(n) = \sum _{i=1}^n \sigma_0(i^2). $$ Given $ N $ , find $ S_2(N) $ .

First line contains $ T $ ( $ 1 \le T \le 10000 $ ), the number of test cases. Each of the next $ T $ lines contains a single integer $ N $ . ( $ 1 \le N \le 10^{12} $ )

For each number $ N $ , output a single line containing $ S_2(N) $ .

5
1
2
3
10
100

1
4
7
48
1194