KT-Yeh

#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
#define INF 999999
using llt = long long int;

llt N, M, D, K;

KT-Yeh

#include <cstdio>
#include <cstring>

int H, W;
bool adjacent[1<<11][1<<11];
long long int dp[13][1<<11];
long long int ans[13][13] = {0};

bool AdjacentCheck(unsigned int, unsigned int);

KT-Yeh

#include <cstdio>
#include <algorithm>

int N, M;
int length[25];

bool dfs(int, int, int, int, bool []);

int main()
{

KT-Yeh

#include <cstdio>
#include <cstring>

struct Combination{
    unsigned int bit;
    int score;
};
Combination C[100];
int dp[1<<9];

KT-Yeh

#include <cstdio>
#include <queue>
using namespace std;
#define BACKTRACKING

#ifdef BITMASK
int main()
{
    int T;
    char line[15];

KT-Yeh

#include <cstdio>
#include <queue>
#include <algorithm>

int dp[1<<16+10] = {0};
const unsigned int Full_Black = (1<<16)-1;
const unsigned int Full_White = 0;

int bfs(unsigned int bit);
unsigned int toggle(unsigned int bit, int pos);

KT-Yeh

#include <cstdio>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;

vector<int> edge[10005];
int dfs_clock, dfn[10005], low[10005];
int cut[10005]; //cut[i]=j表示割點i能把圖切成j個分支

KT-Yeh

#include <vector>
#include <set>
#include <map>
#include <string>
#include <iostream>
using namespace std;

map<string, int> Map;
string numToStr[105];

KT-Yeh

#include <vector>
#include <set>
#include <cstdio>
#include <algorithm>
using namespace std;

vector<int> edge[1005];
int dfs_clock, dfn[1005], low[1005];
set<int> ans;   // 存有哪些割點
int cut[1005];  // cut[i]=j表示割點i能把圖切成j個分支

KT-Yeh

#include <map>
#include <vector>
#include <iostream>
#include <cstdio>
using namespace std;

map<string, int> Map;
string numToStr[30];

vector<int> edge[30];