算法进阶-深度优先搜索
算法进阶-深度优先搜索High33 迷宫寻路123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687#include <bits/stdc++.h>using namespace std;using ll = long long;using ull = unsigned long long;using pii = pair<int, int>;using pll = pair<ll, ll>;using vi = vector<int>;using vll = vector<ll>;#define pb push_back#define m_p make_pair#define fi first#define se secondconst int MO...
算法进阶-简单组合数学
算法进阶-简单组合数学High21 穿搭大挑战123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960#include <bits/stdc++.h>using namespace std;using ll = long long;using ull = unsigned long long;using pii = pair<int, int>;using pll = pair<ll, ll>;using vi = vector<int>;using vll = vector<ll>;#define pb push_back#define m_p make_pair#define fi first#define se secondconst int MOD = 1000000007;const int INF = 0x3f3f3f3f;const ll LI...
算法进阶-递归算法
算法进阶-递归算法High11 大水题1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950#include <bits/stdc++.h>using namespace std;using ll = long long;using ull = unsigned long long;using pii = pair<int, int>;using pll = pair<ll, ll>;using vi = vector<int>;using vll = vector<ll>;#define pb push_back#define mp make_pair#define fi first#define se secondconst int MOD = 1000000007;const int INF = 0x3f3f3f3f;const ll LINF = 0x3f3f3f3f3f3f3f3fLL...
算法进阶-数论进阶
算法进阶-数论进阶High2123456789101112131415161718192021222324252627282930#include <iostream>#include<vector>using namespace std;int main() { int T; cin>>T; while(T--){ string N; cin>>N; long long n=stoll(N); int can=0; for(auto ch:N){ int dight=ch-'0'; if(dight==0||n%dight==0){ //主要条件，不用去重 can++; } } if(can==N.size()){ ...
算法入门-构造算法
算法入门-构造算法BGN72 茉茉的密码12345678910111213141516171819202122232425262728293031//茉茉的密码#include <bits/stdc++.h>using namespace std;typedef long long ll;const int INF = 0x3f3f3f3f;#define sz size()int main () { ios_base::sync_with_stdio (false); cin.tie (0); map<char,ll> m; int n; cin >> n; vector<string> v(n); for (int i=0;i<n;i++) cin >> v[i]; for (int i=0;i<n;i++) { map<char,ll> mo; for (int j=0;j<v[i].sz;...
算法入门-简单动态规划
算法入门-简单动态规划BGN64 硬币凑钱12345678910111213141516171819//// Created by XIAOBAI on 2026/5/11.//#include <iostream>#include <algorithm>//硬币凑钱using namespace std;const int N=1e6+10;int dp[N];int main() { int n; cin>>n; for (int i=1;i<n;i++) { dp[i]=dp[i-1]+1; if (i>=5)dp[i]=min(dp[i],dp[i-5]+1); if (i>=7)dp[i]=min(dp[i],dp[i-7]+1); } cout<<dp[n]<<endl;} BGN65 小红的地砖123456789101112131415161718192021222324252...
算法入门-前缀和和差分数组
算法入门-前缀和和差分数组BGN51 静态区间和（前缀和）123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960//// Created by XIAOBAI on 2026/5/21.//静态区间和（前缀和）#include <iostream>#include<unordered_map>#include<set>#include<string>#include <vector>#include <algorithm>#include <queue>#include <cmath>#include <bitset>#include <unordered_set>#include <map>using namespace std;const int MOD1 = 1e9 + 7;co...
算法入门-简单数论
算法入门-简单数论BGN41 判断质数123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051//// Created by XIAOBAI on 2026/5/21.//判断质数#include <iostream>#include<unordered_map>#include<set>#include<string>#include <vector>#include <algorithm>#include <queue>#include <cmath>#include <bitset>#include <unordered_set>#include <map>using namespace std;const int MOD1 = 1e9 + 7;const int MOD2 = 998244353;using ll ...
算法入门-贪心算法
算法入门-贪心算法BGN29 小红的优惠券1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859//// Created by XIAOBAI on 2026/5/18.//小红的优惠券//// Created by XIAOBAI on 2026/5/18.//最大 FST 距离#include <iostream>#include<unordered_map>#include<set>#include<string>#include <vector>#include <algorithm>#include <queue>#include <cmath>#include <bitset>#include <unordered_set>#include <map>using namespa...
算法入门-排序算法
算法入门-排序算法BGN25 小红书推荐系统123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960//// Created by XIAOBAI on 2026/5/7.//#include <iostream>#include<unordered_map>#include<set>#include<string>#include <vector>#include <algorithm>#include <queue>#include <cmath>#include <bitset>#include <unordered_set>#include <map>using namespace std;//小红书推荐系统const int MOD1 = 1e9 + 7;const int M...