Skip to content

Instantly share code, notes, and snippets.

View kuoe0's full-sized avatar

Chih-Hsuan Kuo kuoe0

72 followers · 12 following
View GitHub Profile
@kuoe0
kuoe0 / selectionSort.cpp
Last active December 14, 2015 11:39
/*=============================================================================
# FileName: selectionSort.cpp
# Desc: Selecetion Sort
# 1. find minimum element in unsorted part
# 2. put minimum element at end of sorted part
# 3. repeat above steps until unsorted part is empty
# Author: KuoE0
# Email: [email protected]
# HomePage: http://kuoe0.ch/
# Version: 0.0.1
@kuoe0
kuoe0 / insertionSort.cpp
Created March 3, 2013 16:42
Insertion Sort
/*=============================================================================
# FileName: insertionSort.cpp
# Desc: Insertion Sort
# Author: KuoE0
# Email: [email protected]
# HomePage: http://kuoe0.ch/
# Version: 0.0.1
# LastChange: 2013-03-04 00:42:04
# History:
=============================================================================*/
@kuoe0
kuoe0 / bubbleSort-flag.cpp
Last active December 14, 2015 07:29
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
using namespace std;
int main() {
int n;
while ( ~scanf( "%d", &n ) ) {
@kuoe0
kuoe0 / 2766_Laserbox.cpp
Created November 4, 2012 14:21
POJ 2766 - http://kuoe0.ch/1931/pku-2766-laserbox/
/*=============================================================================
# FileName: 2766_Laserbox.cpp
# Desc: POJ 2766 - http://poj.org/problem?id=2766
# Author: KuoE0
# Email: [email protected]
# HomePage: http://kuoe0.ch/
# Version: 0.0.1
# LastChange: 2012-11-04 21:35:23
# History:
=============================================================================*/
@kuoe0
kuoe0 / GT-TSP-DP.cpp
Last active June 26, 2018 15:13
[Algorithm] Traveling Salesman's Problem - DP solution - http://kuoe0.ch/1878/algorithm-traveling-salesman-s-problem-dp-solution
/*=============================================================================
# FileName: GT-TSP-DP.cpp
# Desc: Traveling Salesman Problem - DP solution
# Author: KuoE0
# Email: [email protected]
# HomePage: http://kuoe0.ch/
# Version: 0.0.1
# LastChange: 2012-10-11 20:59:01
# History:
=============================================================================*/
@kuoe0
kuoe0 / a542-detA.cpp
Created October 2, 2012 19:33
[ZJ] a542 - 行列式 det(A) - http://kuoe0.ch/1852/zj-a542-det-a/
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
#define mod 100000007
long long int gcd( long long int a, long long int b, long long int &x, long long int &y ) {
@kuoe0
kuoe0 / 3169 - Layout.cpp
Created March 1, 2012 15:26
[POJ] 3169 - Layout - http://kuoe0.ch/1519/poj-3169-layout/
#include <iostream>
#include <queue>
using namespace std;
#define MAXN 1010
struct EDGE {
int v, w, next;
};
EDGE edge[ 3000010 ];
@kuoe0
kuoe0 / 3723 - Conscription.cpp
Created February 16, 2012 08:16
[POJ] 3723 - Conscription - http://kuoe0.ch/1515/poj-3723-conscription/
/*
* =====================================================================================
*
* Filename: 3723 - Conscription.cpp
*
* Description: http://poj.org/problem?id=3723
*
*
* Version: 1.0
* Created: 2012/02/16 14時59分31秒
@kuoe0
kuoe0 / 2431 - Expedition.cpp
Created February 10, 2012 13:49
[POJ] 2431 – Expedition - http://kuoe0.ch/1512/poj-2431-expedition/
/*
* =====================================================================================
*
* Filename: 2431 - Expedition.cpp
*
* Description: http://poj.org/problem?id=2431
*
* Version: 1.0
* Created: 2012/02/08 18時46分09秒
* Revision: none
@kuoe0
kuoe0 / 3259 - Wormholes.cpp
Created January 16, 2012 08:59
[POJ] 3259 - Wormholes - http://kuoe0.ch/617/poj-3259-wormholes/
#include <iostream>
#include <cstdio>
#include <queue>
#include <algorithm>
#include <vector>
using namespace std;
vector< vector< pair< int, int > > > vertex;
vector< int > dist, cnt;
vector< bool > inque;
int n, k, m;