SDAU训练指南-数论2L(等差数列）n*(a1+an)/2

Now a days a very common problem is: “The coordinate of two points in Cartesian coordinate system is (200, 300) and (4000, 5000). If these two points are connected we get a line segment. How many lattice points are there on this line segment”. You will have to do a similar task in this problem — the only difference is that the terminal coordinates can be fractions. Input First line of the input file contains a positive integer N (N ≤ 50000) that denotes how many lines of inputs follow. This line is followed by N lines each of which contains four floating-point numbers x1, y1, x2, y2 (0 < |x1|, |y1|, |x2|, |y2| ≤ 200000). These floating-point numbers has exactly one digit after the decimal point. Output For each line of input except the first line produce one line of output. This line contains an integer which denotes how many lattice points are there on the line segment that connects the two points (x1, y1) and (x2, y2). Sample Input 3 10.1 10.1 11.2 11.2 10.2 100.3 300.3 11.1 1.0 1.0 2.0 2.0 Sample Output 1 0 2

#include<iostream>
using namespace std;
#define ll long long
int main()
{
    ll n,k;
    while(cin>>n>>k)
    {
        if(n>=k)
        {
            ll ans = 0;
            for(ll l = 1, r; l <= k; l = r + 1)
            {
                r = k / (k / l);
                ll a1=k%l,length=(r-l+1),an=k%r;
                ans += length*(a1+an)/2;
            }
            cout<<ans+(n-k)*k<<endl;
        }
        else
        {
            ll ans = 0;
            for(ll l = 1, r; l <= n; l = r + 1)
            {
                r = min(n,k / (k / l));
                ll a1=k%l,length=(r-l+1),an=k%r;
                ans += length*(a1+an)/2;
            }
            cout<<ans<<endl;
        }
    }
    return 0;
}