Mathematical Practice
程序员文章站
2022-06-18 13:58:26
...
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod=998244353;
ll n,m;
ll pow(ll a,ll b)
{
if(b==0) return 1;
if(b%2==1) return a*pow(a,b-1)%mod;
else
{
ll mul=pow(a,b/2);
return mul*mul%mod;
}
}
int main()
{
ios::sync_with_stdio(false);
cin>>n>>m;
cout<<pow(m+1,n)<<endl;
}
上一篇: python实现单机五子棋
下一篇: 字节跳动战投部已解散
推荐阅读
-
Practice:SQLite数据库更名运算实践
-
PAT (Basic Level) Practice (中文)1001
-
vue-practice
-
【Python Practice】Day 13 Question 47-50
-
PAT (Basic Level) Practice (中文)1009 说反话 (20 分)
-
PAT (Basic Level) Practice 1009 说反话 (20 分)
-
PAT (Basic Level) Practice (中文)1009 说反话 (20)
-
PAT (Advanced Level) Practice - 1122 Hamiltonian Cycle(25 分)
-
PAT (Basic Level) Practice (中文)1066 图像过滤 (15 分)(C实现)
-
1066 图像过滤 (15 分)—PAT (Basic Level) Practice (中文)