Codeforces Round #422 (Div. 2) D - My pretty girl Noora

最新推荐文章于 2017-07-07 20:26:00 发布

转载最新推荐文章于 2017-07-07 20:26:00 发布 · 143 阅读

本内容遵循CC 4.0 BY-SA版权协议

原文链接：http://www.cnblogs.com/mgz-/p/7112251.html

在Pavlopolis大学的选美比赛中，为了找出最少的比较次数来确定Miss Pavlopolis University，组织者引入了一个数学问题。他们希望在每轮比赛中将参赛者分成小组，使得总比较次数最小化。此问题被转化为一个数学函数f(n)，表示如果有n名女孩参加比赛，选择最美女孩子的最少比较次数。Noora被要求计算一个表达式的值，该表达式涉及f(n)函数和一些给定参数。

In Pavlopolis University where Noora studies it was decided to hold beauty contest "Miss Pavlopolis University". Let's describe the process of choosing the most beautiful girl in the university in more detail.

The contest is held in several stages. Suppose that exactly n girls participate in the competition initially. All the participants are divided into equal groups, x participants in each group. Furthermore the number x is chosen arbitrarily, i. e. on every stage number x can be different. Within each group the jury of the contest compares beauty of the girls in the format "each with each". In this way, if group consists of x girls, then $\text{[math]}$ comparisons occur. Then, from each group, the most beautiful participant is selected. Selected girls enter the next stage of the competition. Thus if n girls were divided into groups, x participants in each group, then exactly $\text{[math]}$ participants will enter the next stage. The contest continues until there is exactly one girl left who will be "Miss Pavlopolis University"

But for the jury this contest is a very tedious task. They would like to divide the girls into groups in each stage so that the total number of pairwise comparisons of the girls is as few as possible. Let f(n) be the minimal total number of comparisons that should be made to select the most beautiful participant, if we admit n girls to the first stage.

The organizers of the competition are insane. They give Noora three integers t, l and r and ask the poor girl to calculate the value of the following expression: t0·f(l) + t1·f(l + 1) + ... + tr - l·f(r). However, since the value of this expression can be quite large the organizers ask her to calculate it modulo 109 + 7. If Noora can calculate the value of this expression the organizers promise her to help during the beauty contest. But the poor girl is not strong in mathematics, so she turned for help to Leha and he turned to you.

Input

The first and single line contains three integers t, l and r (1 ≤ t < 109 + 7, 2 ≤ l ≤ r ≤ 5·106).

Output

In the first line print single integer — the value of the expression modulo 109 + 7.

Example

input

2 2 4

output

Note

Consider the sample.

It is necessary to find the value of $\text{[math]}$ .

f(2) = 1. From two girls you can form only one group of two people, in which there will be one comparison.

f(3) = 3. From three girls you can form only one group of three people, in which there will be three comparisons.

f(4) = 3. From four girls you can form two groups of two girls each. Then at the first stage there will be two comparisons, one in each of the two groups. In the second stage there will be two girls and there will be one comparison between them. Total 2 + 1 = 3 comparisons. You can also leave all girls in same group in the first stage. Then $\text{[math]}$ comparisons will occur. Obviously, it's better to split girls into groups in the first way.

Then the value of the expression is $\text{[math]}$ .

一开始的划分尽可能的小，比如6，先按2人一组再按3人一组，这样会比先按3人一组再按2人一组的比较次数要小。

线性筛记录每个数的最小因数，任意一个数的，如果为素数那么只能划分为一组，dp[i]=i*(i-1)/2;

否则dp[i]=i/最小因数 * dp[最小因数] + dp[i/最小因数]。

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<cmath>
#include<set>
#include<stack>
#define ll long long
#define pb push_back
#define max(x,y) ((x)>(y)?(x):(y))
#define min(x,y) ((x)>(y)?(y):(x))
#define cls(name,x) memset(name,x,sizeof(name))
using namespace std;
const int inf=1e9+10;
const ll llinf=1e16+10;
const int maxn=5e6+10;
const int maxm=20;
const int mod=1e9+7;
const double pi=acos(-1.0);
ll t,l,r;
ll dp[maxn];
int fac[maxn];
bool prime[maxn];
void init()
{
    cls(prime,0);
    for(int i=2;i<maxn;i++)
        fac[i]=i;
    for(int i=2;i<maxn;i++)
    {
        if(prime[i]==0)
        {
            for(int j=2;i*j<maxn;j++)
            {
                fac[i*j]=min(fac[i*j],i);
                prime[i*j]=1;
            }
        }
    }
    for(ll i=2;i<maxn;i++)
    {
        if(prime[i])
            dp[i]=(dp[fac[i]]*(i/fac[i])+dp[i/fac[i]])%mod;
        else
            dp[i]=(i*(i-1)/2)%mod;
    }
}
int main()
{
    //freopen("in.txt","r",stdin);
    init();
    while(~scanf("%I64d %I64d %I64d",&t,&l,&r))
    {
        ll ans=0;
        ll k=1;
        for(int i=l;i<=r;i++)
        {
            ans=(ans+(k*dp[i])%mod)%mod;
            k=(k*t)%mod;
        }
        printf("%I64d\n",ans);
    }
    return 0;
}

转载于:https://www.cnblogs.com/mgz-/p/7112251.html