- problem solution codes #include<iostream> using namespace std; int n, c[20]; void dfs(int cur... problem solution codes #include<iostream> using namespace std; int n, c[20]; void dfs(int cur...
- problem solution codes //c[i]:第i行的皇后放在第几列 #include<iostream> using namespace std; int n, c[20... problem solution codes //c[i]:第i行的皇后放在第几列 #include<iostream> using namespace std; int n, c[20...
- problem solution codes #include<cstdio> int p[101], a[101], k, n; long long ans[100001], MIN... problem solution codes #include<cstdio> int p[101], a[101], k, n; long long ans[100001], MIN...
- problem solution codes //(如果你玩数独会怎么填呢)......启发式:把能确定的填上 #include<iostream> using namespace st... problem solution codes //(如果你玩数独会怎么填呢)......启发式:把能确定的填上 #include<iostream> using namespace st...
- problem 给出n个正整数，然后有m个询问询问该整数是否在n个正整数中出现过 solution 哈希表？ 当然是set水洛 codes #include<iostream> #... problem 给出n个正整数，然后有m个询问询问该整数是否在n个正整数中出现过 solution 哈希表？ 当然是set水洛 codes #include<iostream> #...
- problem solution codes #include<iostream> #include<queue> using namespace std; struct x... problem solution codes #include<iostream> #include<queue> using namespace std; struct x...
- problem solution codes #include<cstdio> int n, A[15], isp[50], vis[50], ok = 1; bool is_prime... problem solution codes #include<cstdio> int n, A[15], isp[50], vis[50], ok = 1; bool is_prime...
- problem solution codes #include<iostream> #include<algorithm> #include<queue> #in... problem solution codes #include<iostream> #include<algorithm> #include<queue> #in...
- problem 给出n只猫及其重量ci每辆车载重不超过w用最少的车将猫运送到山底n<=18 solution 1、n<=18，暴搜。 2、关于答案： 对于每只猫，要么用已有的缆车，要... problem 给出n只猫及其重量ci每辆车载重不超过w用最少的车将猫运送到山底n<=18 solution 1、n<=18，暴搜。 2、关于答案： 对于每只猫，要么用已有的缆车，要...
- problem solution codes #include<iostream> using namespace std; int n, ans = 0, t; void f(int ... problem solution codes #include<iostream> using namespace std; int n, ans = 0, t; void f(int ...
- problem solution codes #include<iostream> using namespace std; const int maxn = 100010; #defi... problem solution codes #include<iostream> using namespace std; const int maxn = 100010; #defi...
- problem solution codes #include<iostream> using namespace std; const int maxn = 1010; int f[m... problem solution codes #include<iostream> using namespace std; const int maxn = 1010; int f[m...
- problem solution codes #include<iostream> #include<algorithm> using namespace std; int ... problem solution codes #include<iostream> #include<algorithm> using namespace std; int ...
- problem solution codes #include<iostream> #include<algorithm> #include<string> #i... problem solution codes #include<iostream> #include<algorithm> #include<string> #i...
- problem solution codes #include<cstdio> #include<queue> #include<set>//set判重防MLE ... problem solution codes #include<cstdio> #include<queue> #include<set>//set判重防MLE ...
上滑加载中
推荐直播
-
华为云码道 × 仓颉编程：工程化AI编码探索2026/05/27 周三 19:00-21:00
刘俊杰-华为云仓颉语言专家/李炎-华为云码道技术专家/王智鹏-OpenCangjie开源社区发起人
本场直播围绕华为云仓颉语言与华为云码道的深度结合，展示华为云智能编程从零基础到高效落地的完整生态能力。以华为云码道为引擎，仓颉语言为载体，带给大家日常提效、趣味创新到极速量产的开发体验。
回顾中
热门标签