KT KT-Yeh

42 followers · 2 following

Taiwan

View GitHub Profile

Recently created

Least recently created

Recently updated

Least recently updated

KT-Yeh / [UVa] 531 Compromise.cpp

Created March 19, 2014 15:24

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

	string A[110], B[110];
	int LCS[110][110] = {0};
	int pre[110][110];

KT-Yeh / [POJ] 2421 Constructing Roads.cpp

Created March 19, 2014 12:01

	#include <cstdio>
	#include <vector>
	#include <algorithm>
	using namespace std;
	struct Edge{
	int A;
	int B;
	int Len;
	}E[15001];
	int Set[2001];

KT-Yeh / [POJ] 2395 Out of Way.cpp

Created March 19, 2014 11:56

	#include <cstdio>
	#include <vector>
	#include <algorithm>
	using namespace std;
	struct Edge{
	int A;
	int B;
	int Len;
	}E[15001];
	int Set[2001];

KT-Yeh / [POJ] 1861 Network.cpp

Created March 19, 2014 11:53

	#include <cstdio>
	#include <vector>
	#include <algorithm>
	using namespace std;
	struct Edge{
	int A;
	int B;
	int Len;
	}E[15001];
	int Set[1001];

KT-Yeh / [POJ] 2533 Longest Orderded Subsequence.cpp

Created March 19, 2014 10:28

	#include <cstdio>
	using namespace std;
	// Method 1
	int main()
	{
	int N;
	scanf("%d", &N);
	int num[1001], LIS[1001];
	int Max = 0;
	for (int i = 0; i < N; ++i) {

KT-Yeh / [POJ] 1751 Highways.cpp

Created March 19, 2014 05:13

	#include <cstdio>
	#include <cmath>
	#include <algorithm>
	using namespace std;
	struct Point{
	int x;
	int y;
	}P[751];
	struct Edge{
	int A;

KT-Yeh / [POJ] 1703 Find them, Catch them.cpp

Created March 17, 2014 14:11

	#include <cstdio>
	using namespace std;

	int N, M;
	int Set[2 * 100005];

	void Initial(int N);
	int Find_Root(int x);
	void SetEnemy(int x, int y);
	void Union(int x, int y);

KT-Yeh / [UVa] 11747 Heavy Cycle Edges.cpp

Created March 16, 2014 13:39

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

	struct Edge{
	int A;
	int B;
	int W;

KT-Yeh / [UVa] 10369 Arctic Network.cpp

Created March 16, 2014 13:29

	#include <cstdio>
	#include <cmath>
	#include <algorithm>
	using namespace std;
	struct Point{
	int X;
	int Y;
	}point[501];
	struct Edge {
	int a_index;

KT-Yeh / [UVa] 10034 Freckles.cpp

Created March 16, 2014 13:12

	#include <cstdio>
	#include <cmath>
	#include <algorithm>
	using namespace std;
	struct point{
	double x;
	double y;
	}P[105];
	struct edge {
	int i_a;