Fair Distribution(整除分块）

Fair Distribution

有n个机器人，m个能量条，能够进行两种操作，n–或m++,每次操作花费1美元，求使得m%n=0的最小花费
$设n减少了x，则花费为n-(n-x)+([\frac{m-1}{n-x}]+1)\ast (n-x)-m=n-m+[\frac{m-1}{n-x}]\ast (n-x),min([\frac{m-1}{n-x}]\ast (n-x))可以用整除分块O(\sqrt{n})来求得。对于[\frac{n}{i}]$,$显然会有很多i的值是相同的，那么把这些i分成一块，只用求一次就行了$$，但是要知道这个块的起始位置，开始位置是我们要枚举的，结束位置为n/(n/i).$

#include <iostream>
#include <cstring>
#include <cmath>
#include <bitset>
#include <queue>
#include <vector>
#include <cstdio>
#include <set>
#include <sstream>
#include <cstring>
#include <algorithm>
#include <map>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define reps(i, a, b) for (int i = a; i >= b; i--)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a*b/gcd(a,b)
#define ls(node) tree[node].ls
#define rs(node) tree[node].rs
#define val(node) tree[node].val
using namespace std;
const int N = 1e6+ 7;
const int M = 50+7;
const int inf = 0x3f3f3f3f;
const int mod = 1e9+7;
typedef long long ll;
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,m;
        int ans=inf;
        scanf("%d%d",&n,&m);
        if(n>=m)
        {
            printf("%d\n",n-m);
        }
        else
        {
           for(int l=1,r;l<=n;l=r+1){
                r=min(n,(m-1)/((m-1)/l));
                ans=min(ans,(m-1)/l*l);
           }
           printf("%d\n",ans+n-m);
        }
    }
    return 0;
}

其他可以用整除分块的题目

约数研究
看起来和整除分块没啥关系，因为一眼看过去根本没有$\sum \frac{n}{i}$,但是$\sum f(i)是可以转化成\sum \frac{n}{i}$的,
${\sum }_1^{n}f(i)={\sum }_{i=1}^{n}i的约数,i的约数={\sum }_1^n[j|i],即能被i整除的数的个数，={\sum }_{i=1}^n{\sum }_{j=1}^n[j|i]={\sum }_{j=1}^n{\sum }_{i=1}^n[j|i],这里就变成了能整除j的个数，那么显然1-n中能整除j的个数为\frac{n}{j},所以原式化为\sum \frac{n}{j},然后就可以用整除分块了。$

#include <iostream>
#include <cstring>
#include <cmath>
#include <bitset>
#include <queue>
#include <vector>
#include <cstdio>
#include <set>
#include <sstream>
#include <cstring>
#include <algorithm>
#include <map>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define reps(i, a, b) for (int i = a; i >= b; i--)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a*b/gcd(a,b)
#define ls(node) tree[node].ls
#define rs(node) tree[node].rs
#define val(node) tree[node].val
using namespace std;
const int N = 1e6+ 7;
const int M = 50+7;
const int inf = 0x3f3f3f3f;
const int mod = 1e9+7;
typedef long long ll;
int main()
{
    int n;
    scanf("%d",&n);
    int ans=0;
    for(int l=1,r;l<=n;l=r+1){
        r=n/(n/l);
        ans+=(r-l+1)*(n/l);
    }
    printf("%d\n",ans);
    return 0;
}

Calculating
和上一题差不多，就是要减去$[1,l]$的。

#include <iostream>
#include <cstring>
#include <cmath>
#include <bitset>
#include <queue>
#include <vector>
#include <cstdio>
#include <set>
#include <sstream>
#include <cstring>
#include <algorithm>
#include <map>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define reps(i, a, b) for (int i = a; i >= b; i--)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a*b/gcd(a,b)
#define ls(node) tree[node].ls
#define rs(node) tree[node].rs
#define val(node) tree[node].val
using namespace std;
const int N = 1e6+ 7;
const int M = 50+7;
const int inf = 0x3f3f3f3f;
const int mod = 998244353;
typedef long long ll;
int main()
{
    ll n,m;
    scanf("%lld%lld",&n,&m);
    ll ans1=0,ans2=0;
    for(ll l=1,r;l<n;l=r+1){
        r=(n-1)/((n-1)/l);
        ans1+=(r-l+1+mod)%mod*((n-1)/l);
        ans1%=mod;
    }
    for(ll l=1,r;l<=m;l=r+1){
        r=m/(m/l);
        ans2+=(r-l+1+mod)%mod*(m/l);
        ans2%=mod;
    }
    printf("%lld\n",(ans2-ans1+mod)%mod);
    return 0;
}