khann的number theory

TimeLimit:1000MS  MemoryLimit:128MB
64-bit integer IO format:%lld
未提交 | 登录后收藏
Problem Description

khann is a very strange ACMer, and therefore he suddenly wondered how many pairs of integers  exist, where , for which 

In this problem,   denotes the greatest common divisor of the numbers  and , and l denotes the smallest common multiple of the numbers  and 
D8B4EED87C09E37C4BD78DC7698146F8.gif

(让大家练练英语

Input

The input consists of multiple test cases. The first line contains a single integer ( )— the number of test cases. Description of the test cases follows.

The first and the only line of each test case contains the integer  ()


Output

For each test case output a single integer — the number of pairs of integers satisfying the condition.

SampleInput
6
1
2
3
4
5
100000000
SampleOutput
1
4
7
10
11
266666666
Submit
题目统计信息详细
总AC数10
通过人数6
尝试人数6
总提交量15
AC率40.00%
AC该题后可以添加标签
贴完标签可以获得20ACB。
并且可以获得本题所有提交代码查看权限。
点击标题可以显示标签。
如果你还没认真思考过这题,请不要查看标签
如果您已经通过了该题,请务为该题贴上标签
作者

T^T Online Judge

[BUG反馈] [FAQ] [闽ICP备17026590号-1]
当前版本:3.24 系统时间: