题目链接
思路:
只有在满足n=1,n是k的倍数,或者n-1是k的倍数时,(n,k)是传奇元组。
代码:
#include<bits/stdc++.h>
#define int long long
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N=1e5+5;
const int M=2e4+5;
const double eps=1e-8;
const int mod=1e9+7;
const int inf=0x7fffffff;
const double pi=3.1415926;
using namespace std;
int n,k,ans;
void solve(int n)
{
int i,j;
for(i=2;i<=n&&i<=k;i=j+1)
{
j=min(n/(n/i),k);
ans=(ans+(j-i+1)%mod*(n/i)%mod)%mod;
}
}
signed main()
{
IOS;
cin>>n>>k;
solve(n);
solve(n-1);
cout<<(ans+n+k-1)%mod<<endl;
return 0;
}