威猛的磨洋工匠人allin实习

分类

/ 注册

全部文章（共39篇）

题解 | 玛雅人的密码(BFS)

#include <algorithm> #include <any> #include <cstdio> #include <iostream> #include <queue> #include <set> #include...

2025-08-20

0 29

题解 | 八皇后

#include <algorithm> #include <iostream> #include <vector> using namespace std; const int N = 8; int n=8; int tem=0; bool col[N],dg[...

2025-08-20

0 32

题解 | 神奇的口袋

#include <iostream> using namespace std; int n,weight=0,res=0; int obj[25]; bool visit[25]; void dfs(int o){ if(weight==40){ res++;...

2025-08-20

0 28

题解 | 找x

#include<iostream> #include<cstdio> #include <vector> #include <algorithm> using namespace std; int main() { vector<in...

2025-08-19

0 34

题解 | 二叉树

#include <iostream> using namespace std; int recursion(int m,int n){ if(m>n)return 0; int s1 = recursion(m*2, n); //递归左子树 int s2...

2025-08-19

0 41

题解 | 全排列

#include <iostream> #include <string> using namespace std; void solve(string pre, string str) { if (str.length() == 1) { cout...

2025-08-19

0 27

题解 | n的阶乘

#include <iostream> using namespace std; long long solve(long long n){ if(n==1)return 1; return n*solve(n-1); } int main() { long...

2025-08-19

0 24

题解 | 代理服务器

#include <iostream> #include <map> #include <utility> #include <vector> using namespace std; map<string,int> proxy; vec...

2025-08-18

0 42

题解 | 鸡兔同笼

#include <iostream> using namespace std; int myless(int n){ int res = 0; while(n>=4){ n-=4; res++; } while(...

2025-08-18

0 38

题解 | 简单计算器

#include <iostream> #include<stack> #include <string> using namespace std; //返回优先级，优先级顺序：# ! + - * / int priority(char c){ if(c...

2025-08-18

0 36