FZU2104之Floor problem

Problem Description

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

3

1   2   3

100   2   100

100   3   100

Sample Output

0

382

332 

AC代码如下：

#include <iostream>
#include <cstdio>
using namespace std;

int fun(int n,int l)
{
    double s=(double)n/l;
    int x=(int)s;
    return x;
}

int main()
{
    int t,sum;
    int n,l,r;
    cin>>t;
    while(t--)
    {
        sum=0;
        cin>>n>>l>>r;
        for(int i=l;i<=r;i++)
            sum+=fun(n,i);
        cout<<sum<<endl;
    }
    return 0;
}