BestCoder Round #49 Gcd and Lcm 即 hdu5341

Gcd and Lcm

Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)

Total Submission(s): 52    Accepted Submission(s): 15

Problem Description

∑ni=1∑nj=1∑nk=1∑nl=1[(i,j),(k,l)]

 

Input

First line contains a single integer  T≤100  which denotes the number of test cases. 

For each test case, there is an positive integer  n≤107 .

 

Output

For each case, output an integer in a single line means the answer mod  232 .

 

Sample Input

  
  

   
   1
1
  
  

 

Sample Output

  
  

   
   1


   
   

    
    

     
     Hint
    
    
[a,b] means lowest common multiple of a and b,(a,b) means greatest common divisor of a and b.
   
   
   
    
  
  

 

Source

BestCoder Round #49 ($)

 

Recommend

hujie   |   We have carefully selected several similar problems for you:   5352  5351  5350  5349  5348 

 

解析：摘自FancyCoder

/*

*/

表示数学太弱，没看懂，先暂且留着，待我更强一点再来解决。