1 条题解
- 
  1
/** * author: 小飞侠cy * created: 2025.06.12 11:39:10 */ #include <bits/stdc++.h> using namespace std; #define ls u << 1 #define rs u << 1 | 1 #define LL long long #define int long long #define PII pair <int, int> #define fi first #define se second #define pub push_back #define pob pop_back #define puf push_front #define pof pop_front #define lb lower_bound #define ub upper_bound #define i128 __int128 #define pcnt(x) __builtin_popcount(x) #define mem(a,goal) memset(a, (goal), sizeof(a)) #define rep(x,start,end) for(int x = (start) - ((start) > (end)); x != (end) - ((start) > (end)); ((start) < (end) ? x ++ : x --)) #define aLL(x) (x).begin(), (x).end() #define sz(x) (int)(x).size() const int INF = 998244353; const int mod = 100003; const int N = 100010; int cal(int a, int b) { int res = 1; while(b) { if(b & 1) res = res * a % mod; a = a * a % mod; b >>= 1; } return res; } void solve() { int m, n; cin >> m >> n; cout << ((cal(m, n) - m * cal(m - 1, n - 1) % mod) + mod) % mod << '\n'; } signed main() { int t = 1; while (t --) solve(); return 0; } 
- 1
 
信息
- ID
 - 5611
 - 时间
 - 1000ms
 - 内存
 - 256MiB
 - 难度
 - 10
 - 标签
 - (无)
 - 递交数
 - 2
 - 已通过
 - 1
 - 上传者