星璇Xx

分类

/ 注册

全部文章（共50篇）

题解 | abb

#include<bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1e5 + 10; int main(){ int n; cin >> n; map<ch...

2026-05-20

0 14

题解 | 【模板】前缀和

#include<bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1e5 + 10; //int a[N]; ll pre[N]; int main(){ int n,m; cin ...

2026-05-19

0 21

题解 | 小苯的最大和

#include<bits/stdc++.h> using namespace std; typedef long long ll; const int N = 2e5 + 10; ll dp[N]; ll a[N]; int main(){ int t; cin >&g...

2026-05-19

0 22

题解 | 矩阵的最小路径和

#include<bits/stdc++.h> using namespace std; typedef long long ll; const int N = 2020; //const int MOD = 998244353; ll dp[N][N]; int main(){...

2026-05-18

0 20

题解 | 数字三角形

#include<bits/stdc++.h> using namespace std; typedef long long ll; const int N = 600; //const int MOD = 998244353; ll dp[N][N]; int main(){ ...

2026-05-18

0 20

题解 | 跳台阶

#include<bits/stdc++.h> using namespace std; typedef long long ll; const int N = 2e5 + 10; const int MOD = 998244353; int dp[N]; int main(){...

2026-05-18

0 17

题解 | 小红走矩阵

#include<bits/stdc++.h> using namespace std; typedef long long ll; const int MOD = 998244353; const int N = 1010,M = 1010; int dp[N][M]; in...

2026-05-18

0 23

题解 | 牛牛的Ackmann

#include<bits/stdc++.h> using namespace std; typedef long long ll; int ack(int m,int n){ if(m == 0) return n+1; else if(m > 0 &&...

2026-05-18

0 16

题解 | 【模板】快速幂

#include<bits/stdc++.h> using namespace std; typedef long long ll; ll fast_pow(ll a,ll b,ll p){ ll ans = 1; a = a % p; while(b){ if(b &...

2026-05-17

0 22

题解 | 斐波那契数列

#include<bits/stdc++.h> using namespace std; typedef long long ll; int feb(int a){ if(a == 0) return 0; else if(a == 1) return 1; return ...

2026-05-17

0 23