Number of Containers

For two integers m and k, k is said to be a container of m if k is divisible by m. Given 2 positive integers n and m (m < n), the function f(n, m) is defined to be the number of containers of m which are also no greater than n. For example, f(5, 1)=4, f(8, 2)=3, f(7, 3)=1, f(5, 4)=0...

Let us define another function F(n) by the following equation: 

 

Now given a positive integer n, you are supposed to calculate the value of F( n).

Input

There are multiple test cases. The first line of input contains an integer T(T<=200) indicating the number of test cases. Then T test cases follow.

Each test case contains a positive integer n (0 < n <= 2000000000) in a single line.

Output

For each test case, output the result F(n) in a single line.

Sample Input

2
1
4

Sample Output

0
4

 这一题要用函数思想解决。不过第一步是要看懂题 o(╥﹏╥)o

我看不懂，借鉴了大神的博客（https://blog.csdn.net/KEYboarderQQ/article/details/54604123）才懂。

感激：不过我还是看不懂题说的什么，

就是计算n/1 +  n/2 + n/3 + ... +n/n - n的值；

本来也想画个图的，但是我不会用；

n=x*y;，y=n/x;  x从1到n-1;可以知道，x和y有重合的部分。

当n开平方的时候，y1=n/1,y2=n/2, y3=n/3;可知n除以（y3,y2]的值都为2,n除以（y2,y1]的值为1，

当n开平方不为整数时要单独判断一下。

代码如下：

#include<stdio.h>
#include<math.h> 
typedef long long ll;
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        ll tt,n,i,sum=0;
        scanf("%lld",&n);
        tt=sqrt(n);
        sum=0;
        for(i=2;i<=tt;i++)
        {
        	sum+=(n/i);
        	sum+=(n/(i-1)-n/i)*(i-1);
		}
		if(n/tt>tt)
		{
			sum+=tt*(n/tt-n/(tt+1));
		}
        printf("%lld\n",sum);
    }
    return 0;
}