时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 256 M,其他语言512 M
64bit IO Format: %lld
题目描述
Given n, count the number of pairs of positive integers (x, y), such that

.
There're t test cases in total.
输入描述:
First line contains an integer
. Next t lines each contains one integer n
.
输出描述:
Output t lines, denoting the answer of each testcase.
示例1
输入
复制
10
10
100
1000
10000
100000
114514
1919810
20190104
123123123123
10000001000000
输出
复制
2
5
14
31
65
67
158
326
5226
22091
备注: