Chih-Hsuan Kuo kuoe0

## 705 - Slash Maze.cpp
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <algorithm>
using namespace std;

#define MAXN 1010

## C - Candy Splitting.cpp
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
#define MAXN 1010

int num[ MAXN ];

int main() {

## B - Magicka.cpp
#include <iostream>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <cstring>
using namespace std;

char combine[ 26 ][ 26 ];
vector< int > oppose[ 26 ];

## 2011 - A - Bot Trust.cpp
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
int main() {
	int test = 0;
	freopen( "A.out", "w", stdout );

## 1094 – Sorting It All Out.cpp
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;

#define MAXN 50
vector< vector< int > > vertex, rev;
int in[ MAXN ], out[ MAXN ], visit[ MAXN ];
int n, e;
vector< int > topo;

## 1971 - Parallelogram Counting.cpp
#include <iostream>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
struct POINT {
	int x, y;
	bool operator< ( const POINT r ) const {
		return ( x < r.x ) || ( x == r.x && y < r.y );

## 2231 - Moo Volume.cpp
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;

int pos[ 10010 ];

int main() {
	int n;

## 837 - Light and Transparencies.cpp
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
using namespace std;

struct POINT  {
	int x;
	bool end;
	double c;

## 10039 - Railroads.cpp
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
#define MAXN 110

## 501 - Black Box.cpp
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;


int main()
{
	#include <iostream>
	#include <cstdio>
	#include <cstring>
	#include <cstdlib>
	#include <vector>
	#include <algorithm>
	using namespace std;

	#define MAXN 1010
	#include <iostream>
	#include <stack>
	#include <cstdio>
	#include <cstdlib>
	#include <vector>
	#include <cstring>
	using namespace std;

	char combine[ 26 ][ 26 ];
	vector< int > oppose[ 26 ];
	#include <iostream>
	#include <map>
	#include <cstdio>
	#include <cstdlib>
	#include <algorithm>
	using namespace std;
	struct POINT {
	int x, y;
	bool operator< ( const POINT r ) const {
	return ( x < r.x ) \|\| ( x == r.x && y < r.y );