题目链接:https://vjudge.net/problem/UVA-1363
题意:给出正整数n和k(1<=n,k<=1e9),计算
解题方案:被除数固定为k,除数依次加1,讲道理余数应该有规律,打表找找规律:
int n,k;
while(~scann(n,k))
{
int sum=0;
FORR(i,1,n)
{
sum+=k%i;
printf("%d ",k%i);
}
printf("\nsum=%d\n",sum);
}
除了前面一点后面的数都是等差数列,倒过来看公差从1到2,3...。
k/i和k/(i+1)差别不大,也就是说,在一段区间l<=i<=r内,k/i都是相等的,那么这样的区间会不会就组成了上面分区段出现的等差数列?
记d=k/i=k/(i+1),则k=i*d+x1=(i+1)*d+x2,则x1-x2=(k-i*d)-(k-(i+1)*d)=d,所以的确是这样的。那么我们只需要在枚举i的时候判断一下是否出现了长度大于1的等差数列,若出现了则直接用求和公式算出。由上面的运行结果可知,每个等差数列长度为(k%i)/(k/i)+1。
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <time.h>
using namespace std;
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define FORR(i,k,n) for(int i=k;i<=n;i++)
#define scan(a) scanf("%d",&a)
#define scann(a,b) scanf("%d%d",&a,&b)
#define scannn(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define mst(a,n) memset(a,n,sizeof(a))
#define ll long long
#define N 1005
#define mod 1000000007
#define INF 0x3f3f3f3f
const double eps=1e-8;
const double pi=acos(-1.0);
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
ll n,k;
while(cin>>n>>k)
{
ll remain=n-k;
n=min(n,k);
ll sum=0,i=1;
while(i<=n)
{
sum+=k%i;
ll d=k/i;
ll cnt=(k%i)/d;
if(cnt)
{
ll cnt1=min(cnt,n-i);//注意防止越界
sum+=cnt1*(k%(i+1))+cnt1*(cnt1-1)/2*(-d);
i+=cnt1;
}
i++;
}
if(remain>0) sum+=remain*k;
cout<<sum<<endl;
}
return 0;
}