2017 Multi-University Training Contest - Team 2 &&hdu 6050 Funny Function

Funny Function

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1109    Accepted Submission(s): 527

Sample Input

2

2 2

3 3

Sample Output

2
33

Source

2017 Multi-University Training Contest - Team 2

 

生病了  找时间来解释

 #include<iostream>
 #include<cstdio>
 #include<algorithm>
 #include<cstring>
 #include<cstdlib>
 #include<string.h>
 #include<set>
 #include<vector>
 #include<queue>
 #include<stack>
 #include<map>
 #include<cmath>
 typedef long long ll;
 typedef unsigned long long LL;
 using namespace std;
 const double PI=acos(-1.0);
 const double eps=0.0000000001;
 const int maxn=+;
 const int mod=1e9+;
 int pow_mod(ll a,ll b)
 {
     ll ans=;
     while(b)
     {
         if(b&)ans=(ans*a)%mod;
         a=(a*a)%mod;
         b>>=;
     }
     return ans;
 }
 int main()
 {
     int t;
     ll n,m;
     scanf("%d",&t);
     while(t--)
     {
         int x,y,ans;
         scanf("%lld%lld",&n,&m);
         if(m==)printf("1\n");
         else
         {
             x=pow_mod(,mod-);
             //printf("%d\n",x);
             y=(pow_mod(,n)-+mod)%mod;
             y=pow_mod(y,m-);
             ans =(1ll*x*y*)%mod;
             if(n%)
             ans=(ans+x)%mod;
         }
         printf("%d\n",ans);
     }
     return ;
 }