#535. 「NOIP2018」填数游戏

yr87228755

于 2022-03-18 11:39:37 发布

阅读量3.5k

点赞数

文章标签：蓝桥杯 p2p

本文链接：https://blog.csdn.net/yr87228755/article/details/123570895

版权

代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#define P 1000000007
using namespace std;
int n,m,inv128=570312504,inv384=190104168;
int add(int x,int y) {return x+y>=P?x+y-P:x+y;}
int dec(int x,int y) {return x-y< 0?x-y+P:x-y;}
int mul(int x,int y) {return 1ll*x*y%P;}
int power(int a,int b){
   int ans=1;
   for(;b;b>>=1,a=mul(a,a)) if(b&1) ans=mul(ans,a);
   return ans;
}
int main(){
   scanf("%d%d",&n,&m);
   if(n>m) swap(n,m);
   if(n==1) printf("%d\n",power(2,m));
   else if(n==2) printf("%d\n",mul(4,power(3,m-1)));
   else if(n==3) printf("%d\n",mul(112,power(3,m-3)));
   else{
       if(m==n) printf("%d\n",(83ll*power(8,n)%P+5ll*power(2,n+7)%P)*inv384%P);
       else printf("%d\n",(83ll*power(8,n)%P+power(2,n+8))*power(3,m-n-1)%P*inv128%P);
   }
   return 0;
}