2313

题目:https://codeforces.com/contest/1260/problem/A
思路:设a1+a2+a3+......+an=sum (n<=c) 使a1^2+a2^2+a3^2+......+an^2最大
易得

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
 
const ll mod=1e9+7;
 
int n,m;
 
ll ksm(ll n,ll x)
{
    ll res=1;
    while(x)
    {
        if(x&1) res=res*n%mod;
        n=n*n%mod;
        x>>=1;
    }
    return res;
}
int main()
{
    cin>>n>>m;
    cout<<ksm((ksm(2,m)+mod-1)%mod,n);
    return 0;
}

猜你喜欢

转载自www.cnblogs.com/c4Lnn/p/12097041.html