Description
给出正整数n和k,计算j(n, k)=k mod 1 + k mod 2 + k mod 3 + … + k mod n的值,其中k mod i表示k除以i的余数。例如j(5, 3)=3 mod 1 + 3 mod 2 + 3 mod 3 + 3 mod 4 + 3 mod 5=0+1+0+3+3=7
Input
输入仅一行,包含两个整数n, k。
Output
输出仅一行,即j(n, k)。
Sample Input
5 3
Sample Output
7
Hint
50%的数据满足:1<=n, k<=1000 100%的数据满足:1<=n ,k<=10^9
Source
CQOI2007
题解:二分查找每块的首尾位置然后等差数列求和
代码:
/*
* @Author: Heristor
* @Date: 2016-06-17 10:02:46
* @Last Modified by: Heristor
* @Last Modified time: 2016-06-18 11:30:59
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <ctime>
#include <vector>
using namespace std;
#define rep(i,l,r) for(i=l;i<=r;i++)
#define ser(i,r,l) for(i=r;i>=l;i--)
#define INF 100005
#define inf 1000000007
typedef long long ll;
priority_queue<int >QwQ;
ll n,K,Ans=0;
int read()
{
int k=0,f=1;
char ch;
while(ch<'0' || ch>'9'){
if(ch=='-')f=-1;
ch=getchar();
}
while(ch>='0' && ch<='9')k=(k<<1)+(k<<3)+ch-'0',ch=getchar();
return k*f;
}
ll Find(ll l,ll r,ll v)
{
int i,j,k;
ll mid=(l+r)/2+1;
if(l==r)return l;
if(K/mid==v)return Find(mid,r,v);
else return Find(l,mid-1,v);
}
void init()
{
int i,j,k;
ll l,r,tmp;
n=read(),K=read();
if(n>K){
Ans=K*(n-K);
n=K-1;
}
l=1;
while(l<=n){
tmp=K/l;
r=Find(l,n,tmp);
Ans+=(ll)(2*K-tmp*(l+r))*(r-l+1)/2;
l=r+1;
}
printf("%lld\n", Ans);
}
void work()
{
int i,j,k;
}
int main()
{
freopen("Bzoj1257.in","r",stdin);
freopen("Bzoj1257.out","w",stdout);
init();
work();
return 0;
}