同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

22140_FactorialFactors

2022-5-16 18:21| 发布者: Hocassian| 查看: 25| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-5-89506143553000-Problem List-采集的数据-后羿采集器.html

Pro.ID

22140

Title

Factorial Factors

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=22140

AC

Submit

Ratio

20.00%

时间&空间限制

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

描述

Given a positive integer N, we could effectively figure out all the factors of N, as N₁, N₂, ..., N_k are aggregate k factors of N ( including 1 and N itself ).

This problem is somewhat complicated. According to these k factors, we respectively calculate up the number of factors of these factors. For example, N₁ may have n₁ factors (including 1 and N₁), N₂ may have n₂ factors, ..., and N_k may have n_k factors.

Now comes the problem, I want to find out the answer of S = n₁³ + n₂³ + ... + n_k³.

输入

The first line of input there is one integer T ( T ≤ 10000 ), giving the number of test cases in the input. For each test case, there is only a positive integer N ( N < 2³¹).

输出

Description

Given a positive integer N, we could effectively figure out all the factors of N, as N₁, N₂, ..., N_k are aggregate k factors of N ( including 1 and N itself ).

Now comes the problem, I want to find out the answer of S = n₁³ + n₂³ + ... + n_k³.

Input

The first line of input there is one integer T ( T ≤ 10000 ), giving the number of test cases in the input. For each test case, there is only a positive integer N ( N < 2³¹).

Output

For each test case, output one line with the answer S.

Sample Input

2
6
9

Sample Output

81
36

Source

ZS 2007 Ex3