Floor problem FZU - 2104

最新推荐文章于 2019-09-04 17:06:18 发布

爱上键盘的小哥哥

最新推荐文章于 2019-09-04 17:06:18 发布

阅读量115

点赞数

分类专栏：暴力枚举

本文链接：https://blog.csdn.net/islittlehappy/article/details/79933218

版权

暴力枚举专栏收录该内容

35 篇文章 0 订阅

订阅专栏

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.

Input

The 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

For each test case, print the result of f(n,L)+f(n,L+1)+...+f(n,R) in a single line.

Sample Input

Sample Output

0
382
332

题意：输入n,L,R;

求所有floor（n/i）的和L<=i<=R;

思路：在cmath函数库有floor函数，返回不大于x的最大整数

代码：

#include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
	int T;
	cin>>T;
	while(T--){
		int n,l,r;
		cin>>n>>l>>r;
		int ans=0;
		for(int i=l;i<=r;i++)
		   ans+=floor(n/i);
		cout<<ans<<endl;
	}
	return 0;
}