All about Algo

[smart022]

深度优先搜索 LeetCode排列组合大全集

知乎：ACM 的正确入门方式是什么 codeforce: A Way to Practice Competitive Programming

[smart022]

提交代码模版

#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define FOR(x,st,n) for(int x = (st); x < (n); ++ x)
#define mem0(a) memset(a,0,sizeof(a))
#define mem_1(a) memset(a,-1,sizeof(a))
#define mem0x(a) memset(a,0x3f,sizeof(a))
#define MAX(a,b) (a)>(b)?(a):(b)
#define MIN(a,b) (a)<(b)?(a):(b)

using namespace std;

typedef long long ll;
typedef long long unsigned llu;
typedef pair<int,int> P;
typedef vector<P> vp;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
const int N = 60001;

int main(){

    freopen("test.in","r",stdin);
    //freopen("test.out","w",stdout);

    int a,b;
    cin>>n;
    //FOR(i,1,n+1) cot[i-1]=i;
    //stk_pos=ans_pos=0;
    n=4;
    stack<int> stk;
    dfs(0,0);
    //cout<<f[n]<<endl;
    return 0;
}