bzoj 1257: [CQOI2007]余数之和 整除分块

bzoj 1257: [CQOI2007]余数之和 整除分块

Code:

#include<bits/stdc++.h>
#define setIO(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout) 
#define maxn 1000000 
#define ll long long 
using namespace std;
int main(){
    // setIO("input"); 
    ll n,k,ans=0;   
    scanf("%lld%lld",&n,&k); 
    if(k>=n){
        for(ll i=1,j;i<=n;i=j+1){
            j=k/(k/i);            
            ll a=k%i,b=k%min(n,j),len=min(n,j)-i+1; 
            ans+=((a+b)*len);             
        }
        printf("%lld",(ans>>1)); 
    }else {
        for(ll i=1,j;i<=k;i=j+1){
            j=k/(k/i);            
            ll a=k%i,b=k%min(k,j),len=min(k,j)-i+1; 
            ans+=(ll)((a+b)*len); 
        } 
        printf("%lld",(ans>>1)+(n-k)*k);
    }
    return 0; 
}

　　

posted @ 2019-05-22 11:14 EM-LGH 阅读( ...) 评论( ...) 编辑 收藏