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 / DataMining-AssociationRule-Apriori.cpp
Last active March 26, 2021 09:34
Data Mining - Association Rule - Apriori Implementation
/*
* =====================================================================================
*
* Filename: Data_Mining-Association_Rule-Apriori.cpp
*
* Description: Data Mining - Association Rule
* Apriori C++ Implementation
*
* Compiler: g++
* Platform: OS X 10.7
@kuoe0
kuoe0 / d151.cpp
Created December 8, 2011 17:55
d151 - Break Up is Hard to Do (http://140.122.185.166/ZeroJudge/ShowProblem?problemid=d151)
bool DFS( int now, int cnt ) {
visit[ now ] = 1;
bool ret = 0;
if ( now == tgA )
ret = BFS( 1 );
if ( !cnt || ret ) {
visit[ now ] = 0;
return ret;
}
@kuoe0
kuoe0 / sieve.cpp
Last active September 29, 2015 11:38
[Prime] Sieve of Eratosthenes - http://kuoe0.ch/1209/prime-sieve-of-eratosthenes/
#include <cstdio>
#include <cstdlib>
using namespace std;
#define MAX 1000000
bool isNotPrime[ MAX + 1 ];
void sieve() {
memset( isNotPrime, 0, sizeof( isNotPrime ) );
isNotPrime[ 0 ] = isNotPrime[ 1 ] = 1;
for ( int i = 2; i <= MAX; i += 2 )
isNotPrime[ i ] = 1;
@kuoe0
kuoe0 / The 3n + 1 Problem.cpp
Created January 11, 2012 15:32
[UVa] 100 – The 3n+1 Problem - http://kuoe0.ch/18/uva-100-the-3n-plus-1-problem/
#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
long long int MAX;
long long int count( int x ) {
if ( x == 1 )
return 0;
@kuoe0
kuoe0 / toExcelColumnName.cpp
Created January 11, 2012 16:01
Google Intern Worksheet - http://kuoe0.ch/313/2011-google-intern-worksheet/
const char* toExcelColumnName( int n ) {
string ret = "";
while ( n ) {
int x = n % 26;
if ( x )
ret += 'A' + x - 1;
else
ret += 'Z', n -= 26;
n /= 26;
}
@kuoe0
kuoe0 / 501 - Black Box.cpp
Created January 13, 2012 07:40
[UVa] 501 - Black Box - http://kuoe0.ch/362/uva-501-black-box/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
int main()
{
@kuoe0
kuoe0 / 10039 - Railroads.cpp
Created January 14, 2012 10:52
[UVa] 10039 – Railroads - http://kuoe0.ch/368/uva-10039-railroads/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
#define MAXN 110
@kuoe0
kuoe0 / 837 - Light and Transparencies.cpp
Created January 14, 2012 12:04
[UVa] 837 - Light and Transparencies - http://kuoe0.ch/377/uva-837-light-and-transparencies/
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
using namespace std;
struct POINT {
int x;
bool end;
double c;
@kuoe0
kuoe0 / 2231 - Moo Volume.cpp
Created January 14, 2012 16:12
[POJ] 2231 - Moo Volume - http://kuoe0.ch/379/poj-2231-moo-volume/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
int pos[ 10010 ];
int main() {
int n;
@kuoe0
kuoe0 / 1971 - Parallelogram Counting.cpp
Created January 14, 2012 16:52
[POJ] 1971 - Parallelogram Counting - http://kuoe0.ch/386/poj-1971-parallelogram-counting/
#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 );