150人阅读 评论(0)

# Number of Containers

Time Limit: 1 Second Memory Limit: 32768 KB

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:

Nowgiven a positive integer n, you are supposed to calculate the value ofF(n).

Input

There are multiple test cases. The first line of input contains an integerT(T<=200) indicating the number of test cases. Then Ttest 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



eg：f(5, 1)=4,即5/1=5,5-1=4;
f(8, 2)=3,即8/2=4,4-1=3;
f(7, 3)=1,即7/3=2,2-1=1;
f(5, 4)=0,即5/4=1,1-1=0;

//求n/1+n/2+….+n/n-n的值

n=x*y坐标上表示应为双曲线。画图后依然是这样。

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

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：5763次
• 积分：269
• 等级：
• 排名：千里之外
• 原创：18篇
• 转载：18篇
• 译文：0篇
• 评论：1条
文章分类
评论排行
最新评论