题目链接 http://acm.hdu.edu.cn/showproblem.php?pid=6467
倒数第三行改成F(n)-(n-1)*2^n=F(n-1)-(n-2)*2^(n-1)
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <deque>
#include <stack>
using namespace std;
typedef long long ll;
const int MAX=1E9+7;;
const int MM=192600817;
deque <ll> dq;
int f(ll a,ll b)
{
ll ans=1;
a%=MAX;
while(b)
{