KT KT-Yeh

KT-Yeh / backtracking3

Last active August 29, 2015 13:57

KT-Yeh / backtracking2

Last active August 29, 2015 13:57

	void backtracking (int N, int Len)
	{
	if (Len == N) {
	輸出答案;
	return;
	}
	for (可能的數字) {
	if (這數字符合)
	backtracking(N, Len + 1);
	}

KT-Yeh / backtracking1.cpp

Last active August 29, 2015 13:57

	#include <iostream>
	#include <string>
	using namespace std;

	string str;
	string Ans; // 過程中保存答案用
	bool choosed[100] = {0}; // choosed[i]==1表示編號i已經出現過

	void backtracking(const int &N);

KT-Yeh / [POJ] 1094 Sorting It All Out.cpp

Last active August 29, 2015 13:57

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

	vector<int> toNxt[30]; // toNxt[i]裡面存i這個點在哪些點前面
	int deg[30]; // deg[i]表示在i前面有多少個點
	vector<int> Ans;

	void Initial(int N)
	{

KT-Yeh / [POJ] 2367 Genealogical tree.cpp

Last active August 29, 2015 13:57

KT-Yeh / [UVa] 872 Ordering.cpp

Created March 9, 2014 13:33

	#include <iostream>
	#include <string>
	#include <vector>
	#include <sstream>
	#include <algorithm>
	using namespace std;

	int Input(char []);
	void Input2(char [], vector<int> [], int []);
	bool backtracking(int, int, vector<int> [], int [], vector<int> &, char []);

KT-Yeh / [UVa] 604 The Boggle Game.cpp

Created March 9, 2014 10:23

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

	void DFS(int i, int j, char board[][4],string &Word, vector<string> &PigEwu);
	int NumOfVowel(string &a);

	int main()

KT-Yeh / [UVa] 193 Graph Coloring.cpp

Created March 9, 2014 06:15

KT-Yeh / [UVa] 10503 The dominoes solitaire.cpp

Created March 9, 2014 04:12

	#include <cstdio>
	using namespace std;

	int N, M;
	int i1, i2, d1, d2, p[20], q[20];
	int choosed[20];

	bool backtracking(int Len, int num)
	{
	if (Len == N) {

KT-Yeh / [UVa] 291 The House of Santa Claus.cpp

Created March 9, 2014 03:43