Rng HDU-6574

Rng

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 454    Accepted Submission(s): 294

 

Problem Description

Avin is studying how to synthesize data. Given an integer n, he constructs an interval using the following method: he first generates a integer r between 1 and n (both inclusive) uniform-randomly, and then generates another integer l between 1 and r (both inclusive) uniform-randomly. The interval [l, r] is then constructed. Avin has constructed two intervals using the method above. He asks you what the probability that two intervals intersect is. You should print p* q(−1)(MOD 1, 000, 000, 007), while pq denoting the probability.

 

 

Input

Just one line contains the number n (1 ≤ n ≤ 1, 000, 000).

 

 

Output

Print the answer.

 

 

Sample Input

1 2

 

 

Sample Output

1 750000006

 

 

Source

2019CCPC-江西省赛（重现赛）- 感谢南昌大学

 

读题的时候在想,咋求个概率还能怼出来大于一的数,后来知道是求逆元,还是太菜.

思路:图片来自:https://www.cnblogs.com/sstealer/p/11250734.html

然后求逆元即可.

我的代码:

#include<bits/stdc++.h>
#define ll long long
using namespace std;

const ll mod = 1000000007;

ll qsm(ll a,ll b)
{
	ll ans=1;
	while(b)
	{
		if(b & 1) ans=ans*a%mod;
		b>>=1;
		a=a*a%mod;
	}
	return ans;
}

int main()
{
	ll n;
	while(cin>>n)
	{
		cout<<(n+1)*qsm(n*2,mod-2)%mod<<endl;
	}
	return 0;
}