.
.
.
.
.
.
程序:
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
long long n,m,s[70000],t[70000],tj,mo=1000000007,ans=0,f[101][70000];
int main ()
{
scanf("%lld%lld",&n,&m);
for (int j=1,x;j<=m;j=x+1)
{
x=m/(m/j);
t[++tj]=x-j+1;
}
for (int i=1;i<=tj;i++)
s[i]=s[i-1]+t[i];
for (int i=2;i<=n;i++)
{
for (int j=1,k=tj;j<=tj;j++,k--)
f[i][j]=(f[i][j]+t[j]*s[k])%mo;
for (int j=1;j<=tj;j++)
s[j]=(s[j-1]+f[i][j])%mo;
}
for (int i=1;i<=tj;i++)
ans=(ans+f[n][i])%mo;
ans%=mo;
printf("%lld",ans);
return 0;
}