题目链接：http://acm.fzu.edu.cn/problem.php?pid=2104
In this problem, we have f(n,x)=Floor[n/x]. Here Floor[x] is the biggest integer such that no larger than x. For example, Floor[1.1]=Floor[1.9]=1, Floor[2.0]=2.
You are given 3 positive integers n, L and R. Print the result of f(n,L)+f(n,L+1)+...+f(n,R), please.
InputThe first line of the input contains an integer T (T≤100), indicating the number of test cases.
Then T cases, for any case, only 3 integers n, L and R (1≤n, L, R≤10,000, L≤R).
Output Sample Input Sample Output Source
代码如下：
#include <cstdio>
#include <cmath>
int main()
{
int t;
int n, l, r;
scanf("%d",&t);
while(t--)
{
scanf("%d%d%d",&n,&l,&r);
double sum = 0;
for(int i = l; i <= r; i++)
{
sum+=floor(n*1.0/i);
}
printf("%.0lf\n",sum);
}
return 0;
}
FZU Problem 2104 Floor problem （数学啊 ）
原文地址：http://blog.csdn.net/u012860063/article/details/41731765
