摘要:
code #include<iostream> using namespace std; const int N=10; int path[N]; int state[N]; int n; void dfs(int u){ if(u>n){ for(int i=1;i<=n;++i){ cout<< 阅读全文
摘要:
code #include<iostream> #include<algorithm> using namespace std; #define rep(i,a,b) for(int i=(a);i<=(b);++i) #define dwn(i,a,b) for(int i=(a);i>=(b); 阅读全文
摘要:
![image](https://img2022.cnblogs.com/blog/1963362/202203/1963362-20220307233258804-88322953.png) ![image](https://img2022.cnblogs.com/blog/1963362/202203/1963362-20220307233248347-802958854.png) 阅读全文
摘要:
![image](https://img2022.cnblogs.com/blog/1963362/202203/1963362-20220307220750896-197918593.png) 阅读全文
摘要:
特性 支持latex link https://www.freeplane.org/wiki/index.php/Home 阅读全文
摘要:
code #include<algorithm> #include<cstring> #include<iostream> using namespace std; const int N=20,M=1<<N; int f[M][N],w[N][N]; int main(){ ios::sync_w 阅读全文
摘要:
code #include<iostream> #include<cstring> #define ll long long using namespace std; int main(){ ios::sync_with_stdio(false); cin.tie(0); ll a,b,p,res= 阅读全文
摘要:
code #include<iostream> #include<algorithm> using namespace std; #define ull unsigned long long ull quick_pow(ull a,ull b,ull p){ ull res=1; while(b){ 阅读全文