TimDumol

0 1 2540
0 2 4619
0 3 5708
0 4 2903
0 5 1524
0 6 3515
0 7 74
0 8 5489
0 9 4753
0 10 381

TimDumol

1 0
3 3
0 1 3
1 2 4
2 0 5
100 4950
0 1 2540
0 2 4619
0 3 5708
0 4 2903

TimDumol

package com.timdumol.algos.numerical;

import java.io.*;
import java.util.*;
import static java.lang.System.*;

public class GaussianElimination {
	public static double[] gaussian(double[][] a, double[] b) {
		for (int i = 0; i < a.length - 1; ++i) {
			{

TimDumol

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <map>
#include <string>
#include <list>

TimDumol

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <stack>

using namespace std;

TimDumol

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <stack>

using namespace std;

TimDumol

package com.timdumol.algos.graphs;
/** Computes the hierarchy of a binary tree given its
 * in-order and pre-order traversals. 
 */
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
import static java.lang.System.*;

public class InOrderPreOrder {

TimDumol

call pathogen#runtime_append_all_bundles()

syntax on
colorscheme slate
set background=dark
set ruler                     " show the line number on the bar
set more                      " use more prompt
set autoread                  " watch for file changes
set number                    " line numbers
set hidden

TimDumol

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <list>
#include <vector>
#include <set>

TimDumol

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <list>
#include <deque>